Short codes with a given covering radius
From MaRDI portal
Recommendations
Cited in
(21)- scientific article; zbMATH DE number 729918 (Why is no real title available?)
- On the resilience of Even-Mansour to invariant permutations
- Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless
- New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
- New quaternary linear codes with covering radius 2
- 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
- Binary (18,11)2 codes do not exist-Nor do (64,53)2 codes
- Minimal 1-saturating sets and complete caps in binary projective spaces.
- Some optimal codes from algebraic geometry and their covering radii
- Linear codes with covering radius 3
- Saturating systems and the rank-metric covering radius
- scientific article; zbMATH DE number 4160649 (Why is no real title available?)
- A construction of small complete caps in projective spaces
- On maximal orthogonal partial Latin squares and minimal codes with specified length, minimum distance and covering radius
- Linear codes from planar functions and related covering codes
- The geometry of covering codes in the sum-rank metric
- Quasi perfect codes in the Cartesian product of some graphs
- On saturating sets in small projective geometries
- The smallest covering code of length 8 and radius 2 has 12 words
- Multiple coverings of the farthest-off points with small density from projective geometry
- On the least covering radius of binary linear codes with small lengths
This page was built for publication: Short codes with a given covering radius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3824230)
