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

DOI10.1109/18.904549zbMath1001.94056OpenAlexW2164969479MaRDI QIDQ4544487

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

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)

Related Items (2)

Additive cyclic codes over mixed alphabets and the football pool problem ⋮ 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