Structure prediction for error pattern and extension of Welch-Berlekamp theorem

zbMATH Open0841.94036MaRDI QIDQ1909421FDOQ1909421

Authors: Dingjia Xin 

Publication date: 23 July 1996

Published in: Chinese Science Bulletin (Search for Journal in Brave)

Recommendations

• Extension of Welch-Berlekamp theorem and universal strategy of decoding algorithm beyond BCH bound
• Analytic approach to coset-leader decoding leads to extension of the Welch-Berlekamp theorem
• 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>
• Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities
• An algebraic procedure for decoding beyond e/sub BCH/

zbMATH Keywords

cyclic codesinterpolation problemBCH bounddecodingWelch-Berlekamp algorithmerror locator

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Cited In (2)

• Extension of Welch-Berlekamp theorem and universal strategy of decoding algorithm beyond BCH bound
• Analytic approach to coset-leader decoding leads to extension of the Welch-Berlekamp theorem

This page was built for publication: Structure prediction for error pattern and extension of Welch-Berlekamp theorem

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