Binary two-error-correcting codes are better than quaternary

DOI10.1007/S00200-003-0128-2zbMATH Open1028.94041OpenAlexW79484201MaRDI QIDQ1403311

Patric R. J. Östergård

Publication date: 1 September 2003

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-003-0128-2

zbMATH Keywords

packingscovering codeserror-correcting codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) 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) Relations with coding theory (11H71)

This page was built for publication: Binary two-error-correcting codes are better than quaternary

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