Quasi-Perfect Linear Codes With Minimum Distance $4$
From MaRDI portal
Publication:3548194
DOI10.1109/TIT.2007.894688zbMath1314.94108MaRDI 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
covering radius; length function; error-correcting codes; quasi-perfect codes; Complete caps in projective spaces
94B05: Linear codes (general theory)
51E22: Linear codes and caps in Galois spaces
94B75: Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory
Related Items
Upper bounds on the smallest size of a complete cap in $\mathrm{PG}(N,q)$, $N\ge3$, under a certain probabilistic conjecture, Small complete caps in PG(N, q), q even, Further results on multiple coverings of the farthest-off points, Embedding 1-factorizations of \(K_n\) in \(PG(2,32)\), Bicovering arcs and small complete caps from elliptic curves, Maximum scattered linear sets and complete caps in Galois spaces, Multiple coverings of the farthest-off points with small density from projective geometry, Small complete caps from singular cubics. II, A construction of small complete caps in projective spaces, Small complete caps in three-dimensional Galois spaces, Complete caps in AG(3, q) from elliptic curves, Small Complete Caps from Singular Cubics, New inductive constructions of complete caps inPG(N, q),qeven
