scientific article; zbMATH DE number 1284421
From MaRDI portal
Publication:4242015
zbMATH Open0922.94020MaRDI QIDQ4242015FDOQ4242015
Authors: Richard A. Brualdi, Simon Litsyn, V. Pless 
Publication date: 18 October 1999
Title of this publication is not available (Why is that?)
Recommendations
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)
Cited In (52)
- Further results on the covering radius of 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
- Covering radius---Survey and recent results
- Exact bounds on the sizes of covering codes
- Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless
- Title not available (Why is that?)
- On octonary codes and their covering radii
- Generalization of the Norse bounds to codes of higher strength
- Explicit codes with low covering radius
- Asymptotic minimum covering radius of block codes
- Unidirectional covering codes
- Bounds for short covering codes and reactive tabu search
- On Generalized Hamming Weights and the Covering Radius of Linear Codes
- Further results on covering codes with radius \(R\) and codimension \(tR+1\)
- On the covering radius of codes
- New bounds for covering codes of radius 3 and codimension \(3 t + 1\)
- Constructing saturating sets in projective spaces using subgeometries
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
- Title not available (Why is that?)
- A Brief Survey of Covering Radius
- 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
- Title not available (Why is that?)
- On the covering radius of some binary cyclic codes
- On the covering radius of Simplex codes
- Covering radii are not matroid invariants
- Minimal 1-saturating sets and complete caps in binary projective spaces.
- Resolution of a conjecture on the covering radius of linear codes
- Asymptotic bounds on the covering radius of binary codes
- Linear codes with covering radius 3
- The two covering radius of the two error correcting BCH code
- Further results on multiple coverings of the farthest-off points
- Covering radius of matrix codes endowed with the rank metric
- An optimal polynomial for a covering radius problem
- On the covering radius of some modular codes
- New bounds for linear codes of covering radii 2 and 3
- Upper bounds on the smallest size of a complete cap in \(\mathrm{PG}(N,q)\), \(N \geq 3\), under a certain probabilistic conjecture
- 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\)
- A construction of small complete caps in projective spaces
- Short codes with a given covering radius
- Asymmetric binary covering codes.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)
- On the covering radius of Reed-Solomon codes
- On the covering radius of binary (14, 6) codes containing the all-one vector
- On the packing radius and the covering radius of equal-weight codes
- Title not available (Why is that?)
- On the covering radii of a class of binary primitive cyclic codes
- On an algebraic method for bounding the covering radius
- Title not available (Why is that?)
- A new approach to the covering radius of codes
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)
