Optimal covering polynomial sets correcting three errors for binary cyclic codes

DOI10.1109/18.992816zbMATH Open1061.94067OpenAlexW2131889035MaRDI QIDQ4674486FDOQ4674486

Authors: Wonjin Sung, John T. Coffey 

Publication date: 11 May 2005

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.992816

Recommendations

• General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n &lt; 63$</tex></formula>
• On the triple-error-correcting cyclic codes with zero set \(\{1, 2^i+1, 2^j+ 1\}\)
• On covering sets for limited-magnitude errors
• scientific article; zbMATH DE number 729916
• The covering radii of a class of binary cyclic codes and some BCH codes

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)

Cited In (2)

• On covering sets for limited-magnitude errors
• General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n &lt; 63$</tex></formula>

This page was built for publication: Optimal covering polynomial sets correcting three errors for binary cyclic codes

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