General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n < 63$</tex></formula>

DOI10.1109/TIT.2006.889465zbMath1310.94197OpenAlexW2124222151MaRDI QIDQ3548088

Emmanuela Orsini, Massimiliano Sala

Publication date: 21 December 2008

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

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

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Related Items (6)

Correcting errors and erasures via the syndrome variety ⋮ GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES ⋮ Improved decoding of affine-variety codes ⋮ On the decoding of binary cyclic codes with the Newton identities ⋮ A commutative algebra approach to linear codes ⋮ HELP: a sparse error locator polynomial for BCH codes

This page was built for publication: 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>