𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some spectral techniques in coding theory

✍ Scribed by Guo-Zhen Xiao; Ba-Zhong Shen; Chuan-Kun Wu; Chi Song Wong


Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
308 KB
Volume
87
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


Some spectral techniques in coding theory, Discrete Mathematics 87 (1991) 181-186. Let f be a real-valued function on the n-dimensional linear space F" over F = (0, 1) and let A be a linear transformation of F" into F". The Walsh spectrum of the composite f 0 A is obtained. In particular, the Walsh spectrum of the degenerated function of f is obtained. Certain known related results are generalized.


πŸ“œ SIMILAR VOLUMES


Local search in coding theory
✍ Emile H.L. Aarts; Peter J.M. van Laarhoven πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 563 KB

We briefly review the application of local search to a special class of coding problems: covering and packing. To use local search techniques, covering and packing problems are viewed as combinatorial optimization problems. The advantage of local search is that it can be applied without the use of