Quasi-Perfect Linear Codes With Minimum Distance $4$

DOI10.1109/TIT.2007.894688zbMath1314.94108OpenAlexW2170865879MaRDI QIDQ3548194

Fabio Pasticci, Massimo Giulietti

Publication date: 21 December 2008

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

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

zbMATH Keywords

covering radiuslength functionerror-correcting codesquasi-perfect codesComplete caps in projective spaces

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (13)

Further results on multiple coverings of the farthest-off points ⋮ A construction of small complete caps in projective spaces ⋮ Embedding 1-factorizations of \(K_n\) in \(PG(2,32)\) ⋮ Small Complete Caps from Singular Cubics ⋮ Bicovering arcs and small complete caps from elliptic curves ⋮ Small complete caps in three-dimensional Galois spaces ⋮ New inductive constructions of complete caps inPG(N, q),qeven ⋮ Small complete caps from singular cubics. II ⋮ Multiple coverings of the farthest-off points with small density from projective geometry ⋮ Small complete caps in PG(N, q), q even ⋮ Maximum scattered linear sets and complete caps in Galois spaces ⋮ Upper bounds on the smallest size of a complete cap in $\mathrm{PG}(N,q)$, $N\ge3$, under a certain probabilistic conjecture ⋮ Complete caps in AG(3, q) from elliptic curves

This page was built for publication: Quasi-Perfect Linear Codes With Minimum Distance $4$