On some bounds on the minimum distance of cyclic codes over finite fields

DOI10.1007/S10623-014-9927-7zbMath1397.94121OpenAlexW2094360276MaRDI QIDQ498967

Oğuz Yayla, Seher Tutdere, Ferruh Özbudak

Publication date: 29 September 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-014-9927-7

zbMATH Keywords

cyclic codesbounds on the minimum distanceZeh-Bezzateev boundZeh-Zeh-Bezzateev bound

Mathematics Subject Classification ID

Bounds on codes (94B65) Cyclic codes (94B15)

Uses Software

• Macaulay2
• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound
• The Magma algebra system. I: The user language
• 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
• Algebraic Function Fields and Codes
• A new lower bound for the minimum distance of a cyclic code
• Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)
• Decoding Cyclic Codes up to a New Bound on the Minimum Distance
• Generalizations of the BCH bound
• Some results on the minimum distance structure of cyclic codes

This page was built for publication: On some bounds on the minimum distance of cyclic codes over finite fields