On the covering radius of binary codes (Corresp.)
From MaRDI portal
Publication:4158944
DOI10.1109/TIT.1978.1055928zbMath0379.94017OpenAlexW2065404462MaRDI QIDQ4158944
Torleiv Kløve, Tor Helleseth, Johannes Mykkeltveit
Publication date: 1978
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1978.1055928
Other types of codes (94B60) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items
On the covering radius of an unrestricted code as a function of the rate and dual distance, A Super-Set of Patterson--Wiedemann Functions: Upper Bounds and Possible Nonlinearities, The covering radius of spherical designs, Asymptotically optimal Boolean functions, Trace codes and families of algebraic curves, The covering radius of doubled 2-designs in \(2O_ k\), The covering radius of Hadamard codes in odd graphs, Some inequalities about the covering radius of Reed-Muller codes, 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class, Quantum Algorithms Related to $$\textit{HN}$$ -Transforms of Boolean Functions, Theoretical upper bounds on the covering radii of Boolean functions, On the combinatorial structure of a class of \(\left[ \binom m 2, \binom{m-1}{2}, 3\right\) shortened Hamming codes and their dual-codes], On deep holes of Gabidulin codes, Further results on the covering radii of the Reed-Muller codes, On upper bounds for code distance and covering radius of designs in polynomial metric spaces, Highly nonlinear functions over finite fields, On triple-sum-sets and two or three weights codes, Good coverings of Hamming spaces with spheres, A Super-Set of Patterson-Wiedemann Functions – Upper Bounds and Possible Nonlinearities, Covering radius and dual distance, Weight distribution and dual distance
