Journal article
M. Giulietti, Fabio Pasticci
IEEE Transactions on Information Theory, 2007
IEEE Transactions on Information Theory, 2007
Semantic Scholar
DBLP
DOI
Cite
Cite
APA
Click to copy
Giulietti, M., & Pasticci, F. (2007). Quasi-Perfect Linear Codes With Minimum Distance $4$. IEEE Transactions on Information Theory.
Chicago/Turabian
Click to copy
Giulietti, M., and Fabio Pasticci. “Quasi-Perfect Linear Codes With Minimum Distance $4$.” IEEE Transactions on Information Theory (2007).
MLA
Click to copy
Giulietti, M., and Fabio Pasticci. “Quasi-Perfect Linear Codes With Minimum Distance $4$.” IEEE Transactions on Information Theory, 2007.
BibTeX Click to copy
@article{m2007a,
title = {Quasi-Perfect Linear Codes With Minimum Distance $4$},
year = {2007},
journal = {IEEE Transactions on Information Theory},
author = {Giulietti, M. and Pasticci, Fabio}
}
Abstract
Some new infinite families of short quasi-perfect linear codes are described. Such codes provide improvements on the currently known upper bounds on the minimal length of a quasi-perfect [n,n-m,4]q-code when either 1) q=16, m ges 5, m odd, or 2) q=2i, 7 les i les 15, m ges 4, or 3) q=22lscr , lscr ges 8, m ges 5, m odd. As quasi-perfect [n,n-m,4]q-codes and complete n-caps in projective spaces PG(m-1,q) are equivalent objects, new upper bounds on the size of the smallest complete cap in PG(m-1,q) are obtained
