New bounds on the minimum distance of cyclic codes

DOI10.3934/amc.2020038zbMath1467.94062OpenAlexW2991580943WikidataQ126757255 ScholiaQ126757255MaRDI QIDQ2025340

Buket Özkaya, San Ling

Publication date: 12 May 2021

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2020038

zbMATH Keywords

cyclic codesproduct codeminimum distance boundRoos bound

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65) Cyclic codes (94B15)

Cites Work

• Unnamed Item
• A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound
• A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
• On a class of error correcting binary group codes
• A new lower bound for the minimum distance of a cyclic code
• Cyclic product codes
• Further results on cyclic product codes
• Generalizations of the BCH bound