Classifying optimal ternary codes of length 5 and covering radius 1

MaRDI QIDQ1856593zbMATH OpenFDO

Authors William D. Weakley, Patric R. J. Östergård

Publication date 10 February 2003

Published in Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/232745, http://www.emis.de/journals/BAG/vol.43/no.2/12.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

nonlinear codeternary codecode equivalencecovering codefootball pool problembacktrack search

Mathematics Subject Classification ID

Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Classification of some optimal ternary linear codes of small length
• scientific article; zbMATH DE number 2148772
• scientific article; zbMATH DE number 1933266
• Classification of binary/ternary one-error-correcting codes
• Enumeration of optimal ternary constant-composition codes

Cited in

(5)

• scientific article; zbMATH DE number 2148772 (Why is no real title available?)
• The number of inequivalent \((2R+3,7)R\) optimal covering codes
• One-error correcting [5, 2] ternary codes
• scientific article; zbMATH DE number 1933266 (Why is no real title available?)
• Classification of binary/ternary one-error-correcting codes

This page was built for publication: Classifying optimal ternary codes of length 5 and covering radius 1

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