On the covering radius of some binary cyclic codes

DOI10.3934/amc.2017025zbMath1362.94065OpenAlexW2613579564MaRDI QIDQ2397496

R. Arce-Nazario, José Ortiz-Ubarri, Francis N. Castro

Publication date: 22 May 2017

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

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

zbMATH Keywords

covering radiusminimum distancebinary cyclic codes

Mathematics Subject Classification ID

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

Related Items (1)

On the covering radius of some binary cyclic codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On binary cyclic codes with minimum distance \(d=3\).
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• On the covering radius of some binary cyclic codes
• A search technique for quasi-perfect codes
• Two-error correcting Bose-Chaudhuri codes are quasi-perfect
• Quasi-Perfect Codes With Small Distance
• Divisibility properties for covering radius of certain cyclic codes
• Fundamentals of Error-Correcting Codes
• Constructions for perfect mixed codes and other covering codes
• On the Covering Radius of Certain Cyclic Codes
• Improvements of the Chevalley-Warning and the Ax-Katz Theorems
• Tight bounds for Chevalley–Warning–Ax–Katz type estimates, with improved applications
• The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes

This page was built for publication: On the covering radius of some binary cyclic codes