The covering radii of a class of binary cyclic codes and some BCH codes

DOI10.1007/s10623-018-0525-yzbMath1421.94104OpenAlexW2886920774WikidataQ129480379 ScholiaQ129480379MaRDI QIDQ1727346

Selçuk Kavut, Seher Tutdere

Publication date: 20 February 2019

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

Full work available at URL: https://doi.org/10.1007/s10623-018-0525-y

zbMATH Keywords

covering radiusfinite fieldcyclic codepolynomial equationsBCH code

Mathematics Subject Classification ID

Cyclic codes (94B15) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (1)

On the covering radii of a class of binary primitive cyclic codes

Cites Work

• Unnamed Item
• Unnamed Item
• Covering radius 1985-1994
• The length of primitive BCH codes with minimal covering radius
• Covering radius for long BCH codes
• On the covering radius of cyclic linear codes and arithmetic codes
• On the covering radius of long binary BCH codes
• Two-error correcting Bose-Chaudhuri codes are quasi-perfect
• An asymptotic bound on the covering radii of binary BCH codes
• Divisibility properties for covering radius of certain cyclic codes
• Covering radius---Survey and recent results
• Complete decoding of triple-error-correcting binary BCH codes
• All binary 3-error-correcting BCH codes of length<tex>2^m-i</tex>have covering radius 5 (Corresp.)
• On the minimum distance of cyclic codes
• Improvements of the Chevalley-Warning and the Ax-Katz Theorems
• More on the covering radius of BCH codes
• Four fundamental parameters of a code and their combinatorial significance

This page was built for publication: The covering radii of a class of binary cyclic codes and some BCH codes