scientific article; zbMATH DE number 1284421
\{ For the entire collection see Zbl 0907.94001 \}. The covering radius of a block code \(C\subseteq F^n_q\) is the smallest integer \(r\) such that every vector in \(F^n_q\) is within Hamming distance \(r\) from at least one codeword. The study of this parameter has attracted a lot of attention, in particular since 1985, when the two papers \textit{G. D. Cohen}, \textit{M. G. Karpovsky}, \textit{H. F. Mattson} jun., and \textit{J. R. Schatz} [IEEE Trans. Inf. Theory IT-31, 328-343 (1985; Zbl 0586.94014) and \textit{R. L. Graham} and \textit{N. J. A. Sloane}, ibid. 385-401 (1985; Zbl 0585.94012)] appeared. After basic results, the authors discuss various constructions including direct sum, amalgamated direct sum (and the related normality concepts), piecewise constant codes, \((u,u+v)\) construction, matrix construction, and cascading. Various techniques are described to obtain lower bounds (= nonexistence results), like the use of embedded codes, linear programming, and excess techniques. This is followed by a number of upper bounds on the covering radius of a given code, including the Norse bounds; the study of descendants and orphans, and bounds on subcodes of a given code. The section on the best known linear codes includes a table of bounds for \(\ell(m,r)\), the smallest length of a binary linear code with codimension \(m\) \((=n-k\), where \(k\) is the dimension) and covering radius \(r\). The next two sections present the known results about the covering radius of Reed-Muller codes, and BCH codes and their duals, and Goppa codes. The last two sections discuss the asymptotical aspects and various generalizations of the basic covering radius problem. Other recent surveys on the topic include \textit{G. D. Cohen}, \textit{S. Litsyn}, \textit{A. C. Lobstein} and \textit{H. F. Mattson} jun. [Appl. Algebra Eng. Commun. Comput. 8, No. 3, 171-239 (1997; Zbl 0873.94025)] and \textit{G. Cohen}, \textit{I. Honkala}, \textit{S. Litsyn} and \textit{A. Lobstein} [Covering codes, Elsevier, Amsterdam (1997; Zbl 0874.94001)].
- 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
- A new approach to the covering radius of codes
- An optimal polynomial for a covering radius problem
- On the covering radius of Reed-Solomon codes
- On the covering radius of long 5-ary BCH codes with minimum distance 7
- Exact bounds on the sizes of covering codes
- Some upper bounds on the covering radii of linear codes over \(\mathbb{F}_q\) and their applications
- The covering radii of a class of binary cyclic codes and some BCH codes
- Asymmetric binary covering codes.
- On the packing radius and the covering radius of equal-weight codes
- Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless
- Constructing saturating sets in projective spaces using subgeometries
- Linear codes with covering radius 3
- The two covering radius of the two error correcting BCH code
- New bounds for linear codes of covering radii 2 and 3
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
- A construction of small complete caps in projective spaces
- On the covering radius of some binary cyclic codes
- Covering radii are not matroid invariants
- Minimal 1-saturating sets and complete caps in binary projective spaces.
- On an algebraic method for bounding the covering radius
- Asymptotic minimum covering radius of block codes
- Generalization of the Norse bounds to codes of higher strength
- Asymptotic bounds on the covering radius of binary codes
- Further results on multiple coverings of the farthest-off points
- scientific article; zbMATH DE number 4208003 (Why is no real title available?)
- On octonary codes and their covering radii
- Unidirectional covering codes
- On covering radius of a family of codes \({\mathcal C}_m\cup(1+{\mathcal C}_m)\) with maximum distance between \({\mathcal C}_m\) and \(1+{\mathcal C}_m\)
- On the covering radius of codes
- Covering radius---Survey and recent results
- scientific article; zbMATH DE number 3965968 (Why is no real title available?)
- Further results on the covering radius of codes
- scientific article; zbMATH DE number 4008282 (Why is no real title available?)
- scientific article; zbMATH DE number 4041787 (Why is no real title available?)
- On the covering radius of binary (14, 6) codes containing the all-one vector
- Explicit codes with low covering radius
- Short codes with a given covering radius
- scientific article; zbMATH DE number 4108663 (Why is no real title available?)
- scientific article; zbMATH DE number 49931 (Why is no real title available?)
- The multicovering radii of codes
- On the covering radius of Simplex codes
- Upper bounds on the smallest size of a complete cap in \(\mathrm{PG}(N,q)\), \(N \geq 3\), under a certain probabilistic conjecture
- A Brief Survey of Covering Radius
- On the covering radius of some modular codes
- scientific article; zbMATH DE number 910954 (Why is no real title available?)
- On the covering radius of convolutional codes
- On the covering radii of a class of binary primitive cyclic codes
- Covering radius of matrix codes endowed with the rank metric
- On Generalized Hamming Weights and the Covering Radius of Linear Codes
- Upper bounds on the length function for covering codes with covering radius R and codimension tR+1
- Further results on covering codes with radius R and codimension tR+1
- Resolution of a conjecture on the covering radius of linear codes
- New bounds for covering codes of radius 3 and codimension \(3 t + 1\)
- Covering radius 1985-1994
- New infinite families of uniformly packed near-MDS codes and multiple coverings, based on the ternary Golay code
- Bounds for short covering codes and reactive tabu search
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242015)
