On the covering radius of ternary negacyclic codes with length up to 26

DOI10.1109/18.904549zbMATH Open1001.94056OpenAlexW2164969479MaRDI QIDQ4544487FDOQ4544487

Tsonka Stefanova Baicheva

Publication date: 4 August 2002

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

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

Recommendations

• The covering radius of ternary cyclic codes with length up to 25
• On the covering radius of ternary extremal self-dual codes
• On the covering radius problem for ternary self-dual codes
• scientific article; zbMATH DE number 2124960
• Binary and ternary codes of covering radius one: some new lower bounds
• Covering radii of ternary linear codes of small dimensions and codimensions
• scientific article; zbMATH DE number 2233286
• On the covering radius of some binary cyclic codes
• scientific article; zbMATH DE number 721640
• The covering radius of cyclic codes of length up to 31 (Corresp.)

zbMATH Keywords

covering radiusternary linear codesternary negacyclic codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cited In (3)

• Additive cyclic codes over mixed alphabets and the football pool problem
• On the covering radius of ternary extremal self-dual codes
• Some results on the structure of constacyclic codes and new linear codes over \(\mathrm{GF}(7)\) from quasi-twisted codes

This page was built for publication: On the covering radius of ternary negacyclic codes with length up to 26

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