On the covering radius of some binary cyclic codes

DOI10.3934/AMC.2017025MaRDI QIDQ2397496zbMATH OpenOpenAlexFDO

Authors R. Arce-Nazario, Jose 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

minimum distancecovering radiusbinary cyclic codes

Mathematics Subject Classification ID

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

Recommendations

• The covering radii of a class of binary cyclic codes and some BCH codes
• scientific article; zbMATH DE number 721640
• scientific article; zbMATH DE number 1284421
• On the covering radii of a class of binary primitive cyclic codes
• Covering Radius Computations for Binary Cyclic Codes

Cites work

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

Cited in

(18)

• The covering radius of extreme binary 2-surjective codes
• The covering radius of cyclic codes of length up to 31 (Corresp.)
• scientific article; zbMATH DE number 5543120 (Why is no real title available?)
• scientific article; zbMATH DE number 727737 (Why is no real title available?)
• scientific article; zbMATH DE number 1522570 (Why is no real title available?)
• The covering radii of a class of binary cyclic codes and some BCH codes
• scientific article; zbMATH DE number 2124960 (Why is no real title available?)
• The covering radius of the cycle code of a graph
• On the covering radius of some binary cyclic codes
• On the covering radius of ternary negacyclic codes with length up to 26
• The two covering radius of the two error correcting BCH code
• Finite Fields and Applications
• On the covering radius of cyclic linear codes and arithmetic codes
• On the covering radius of binary codes (Corresp.)
• The average dimension of the hull cyclic codes
• On the covering radii of a class of binary primitive cyclic codes
• scientific article; zbMATH DE number 721640 (Why is no real title available?)
• Divisibility properties for covering radius of certain cyclic codes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397496)