Covering radius---Survey and recent results

DOI10.1109/TIT.1985.1057043zbMath0586.94014OpenAlexW2126655674MaRDI QIDQ3713988

H. F. jun. Mattson, Mark G. Karpovsky, James Schatz, Gérard D. Cohen

Publication date: 1985

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1985.1057043

zbMATH Keywords

upper boundsReed-Muller codesHamming distancelower boundsasymptotic resultspacking radiustranslate leader

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Relations with coding theory (11H71)

Related Items (max. 100)

Lower bounds for \(q\)-ary coverings by spheres of radius one ⋮ A new approach to the covering radius of codes ⋮ On the covering of vertices for fault diagnosis in hypercubes ⋮ On ℤ_q-linear and ℤ_q-Simplex codes and its related parameters forqis a prime power ⋮ Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\) ⋮ On the covering radii of a class of binary primitive cyclic codes ⋮ \(GL(m,2)\) acting on \(R(r,m)/R(r-1,m)\) ⋮ A construction of small complete caps in projective spaces ⋮ The solution to Berlekamp's switching game ⋮ New upper bounds for binary covering codes ⋮ The covering radius problem for sets of 1-factors of the complete uniform hypergraphs ⋮ On the covering radius of an unrestricted code as a function of the rate and dual distance ⋮ Simplex and MacDonald codes over \(R_q\) ⋮ Covering Radius of Matrix Codes Endowed with the Rank Metric ⋮ On covering radius of codes over R = ℤ2 + uℤ2, where u2 = 0 using chinese euclidean distance ⋮ A construction of bent functions of \(n+2\) variables from a bent function of \(n\) variables and its cyclic shifts ⋮ Optimization of $$\mathsf {LPN}$$ Solving Algorithms ⋮ On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius ⋮ On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes ⋮ On the covering radius of a code and its subcodes ⋮ Some optimal codes from algebraic geometry and their covering radii ⋮ On normal \(q\)-ary codes in Rosenbloom-Tsfasman metric ⋮ Diameter, covering index, covering radius and eigenvalues ⋮ The covering radii of a class of binary cyclic codes and some BCH codes ⋮ On the covering radius of some modular codes ⋮ On the parameters of codes for the Lee and modular distance ⋮ On codes over ℤp2 and its covering radius ⋮ The covering radius of spherical designs ⋮ Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four ⋮ A note on the covering radius of optimum codes ⋮ All binary codes with covering radius one are subnormal ⋮ Covering bounds for codes ⋮ Frequency computation and bounded queries ⋮ Universal forecasting algorithms ⋮ Trace codes and families of algebraic curves ⋮ Lower bound of the covering radius of irreducible Goppa codes ⋮ On covering problems of codes ⋮ Reflection ciphers ⋮ Lower bound of covering radius of binary irreducible Goppa codes ⋮ On some classes of linear codes over \(\mathbb{Z}_2\mathbb{Z}_4\) and their covering radii ⋮ The covering radius of doubled 2-designs in \(2O_ k\) ⋮ A Graham-Sloane type construction for \(s\)-surjective matrices ⋮ The multicovering radius problem for some types of discrete structures ⋮ The covering radius of Hadamard codes in odd graphs ⋮ Application of coding theory to interconnection networks ⋮ On the covering radius of Reed-Muller codes ⋮ On lengthening of covering codes ⋮ Some inequalities about the covering radius of Reed-Muller codes ⋮ Dual distances of completely regular codes ⋮ 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 the covering radius of Simplex codes ⋮ Bounds on the sizes of constant weight covering codes ⋮ Bounds for binary multiple covering codes ⋮ On covering radius of codes over ℤ2p ⋮ Upper bounds for football pool problems and mixed covering codes ⋮ Construction of new codes and its related parameters ⋮ Extremal self-dual \([40,20,8\) codes with covering radius 7] ⋮ The covering radius of the Reed-Muller code \(\text{RM}(2, 7)\) is \(40\) ⋮ The packing problem in statistics, coding theory and finite projective spaces ⋮ Rank-Metric Codes and Their Applications ⋮ The decoding of extended Reed-Solomon codes ⋮ Simplifications to ``A new approach to the covering radius ⋮ Good coverings of Hamming spaces with spheres ⋮ On exact quantum query complexity ⋮ Hamming codes for wet paper steganography ⋮ On the covering radius of Reed-Solomon codes ⋮ Asymmetric binary covering codes. ⋮ Classification of cosets of the Reed-Muller code \(R(m-3,m)\) ⋮ Maximality of the cycle code of a graph ⋮ On the normality of multiple covering codes

This page was built for publication: Covering radius---Survey and recent results