Linear codes with covering radius 2 and other new covering codes

DOI10.1109/18.61146zbMATH Open0713.94018OpenAlexW2051841789MaRDI QIDQ3199331FDOQ3199331

Authors: Alexander A. Davydov, L. M. Tombak, E. M. Gabidulin

Publication date: 1991

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

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

Recommendations

Constructions and families of nonbinary linear codes with covering radius 2
Publication:4886129
Linear codes with covering radius R=2, 3 and codimension tR
Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry
scientific article; zbMATH DE number 1188995

zbMATH Keywords

covering codes covering radius minimal distance linear binary codes complete caps in projective geometry

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cited In (42)

New upper bounds for binary covering codes
Minimal second order saturated designs and their applications to space-filling designs
Title not available (Why is that?)
On the resilience of Even-Mansour to invariant permutations
On a class of binary linear completely transitive codes with arbitrary covering radius
Strong orthogonal arrays of strength two plus
On identifying codes in binary Hamming spaces
On the Newton and covering radii of linear codes
Explicit codes with low covering radius
Small complete caps in Galois affine spaces
On sizes of complete caps in projective spaces $\mathrm{PG}(n, q)$ and arcs in planes $\mathrm{PG}(2, q)$
Recursive constructions of complete caps
On the spectrum of the values $k$ for which a complete $k$-cap in $PG(n,q)$ exists
The packing problem in statistics, coding theory and finite projective spaces
A class of complete $k$-caps in $PG(3,q)$ for $q$ an odd prime
Linear Codes With Covering Radius<tex>$2$</tex>,<tex>$3$</tex>and Saturating Sets in Projective Geometry
Three questions of Bertram on locally maximal sum-free sets
New inductive constructions of complete caps in $\mathrm{PG}(N, q)$, $q$ even
Small complete caps in $PG(r,q)$, $r\geq 3$
On the structure of linear codes with covering radius two and three
On the non-trivial minimal blocking sets in binary projective spaces
On cyclic caps in 4-dimensional projective spaces
Minimal 1-saturating sets and complete caps in binary projective spaces.
Title not available (Why is that?)
Constructions, families, and tables of binary linear covering codes
A family of small complete caps in $\text{PG}(n,2)$
Linear codes with covering radius 3
Title not available (Why is that?)
Title not available (Why is that?)
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$
Title not available (Why is that?)
A construction of small complete caps in projective spaces
Short codes with a given covering radius
Linear codes with covering radius R=2, 3 and codimension tR
Small Complete Caps from Singular Cubics
On saturating sets in small projective geometries
On near-MDS codes and caps
Small complete caps in PG(4n+1,q)${\rm PG}(4n+1, q)$
A family of complete caps in $\mathbf{PG}(n,2)$
Classification and constructions of complete caps in binary spaces
Constructions of small complete caps in binary projective spaces

This page was built for publication: Linear codes with covering radius 2 and other new covering codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3199331)