Covering radii of ternary linear codes of small dimensions and codimensions

DOI10.1109/18.641577MaRDI QIDQ4392415zbMATH OpenOpenAlexFDO

Authors Evgenia D. Velikova, Tsonka Stefanova Baicheva

Publication date 12 November 1999

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

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

zbMATH Keywords

covering radiusternary linear codes

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• scientific article; zbMATH DE number 1188977
• scientific article; zbMATH DE number 1189030
• Linear codes with covering radius 3
• On the least covering radius of binary linear codes of dimension 6

Cited in

(11)

• The covering radius of ternary cyclic codes with length up to 25
• On saturating sets in small projective geometries
• Linear codes with covering radius 3
• scientific article; zbMATH DE number 4016768 (Why is no real title available?)
• scientific article; zbMATH DE number 4095515 (Why is no real title available?)
• scientific article; zbMATH DE number 1188977 (Why is no real title available?)
• scientific article; zbMATH DE number 1189030 (Why is no real title available?)
• On the structure of linear codes with covering radius two and three
• On the covering radius of ternary negacyclic codes with length up to 26
• scientific article; zbMATH DE number 2124960 (Why is no real title available?)
• Recursive constructions of complete caps

This page was built for publication: Covering radii of ternary linear codes of small dimensions and codimensions

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