Extension of Welch-Berlekamp theorem and universal strategy of decoding algorithm beyond BCH bound

zbMATH Open0841.94037MaRDI QIDQ1908620FDOQ1908620

Authors: Dingjia Xin 

Publication date: 23 July 1996

Published in: Science in China. Series A (Search for Journal in Brave)

Recommendations

• Structure prediction for error pattern and extension of Welch-Berlekamp theorem
• An algebraic procedure for decoding beyond e/sub BCH/
• Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities
• Analytic approach to coset-leader decoding leads to extension of the Welch-Berlekamp theorem
• Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e<e/sub BCH/

zbMATH Keywords

cyclic codesBCH bounddecodingWelch-Berlekamp algorithmWelch-Berlekamp theorem

Mathematics Subject Classification ID

Cyclic codes (94B15) Bounds on codes (94B65) Decoding (94B35)

Cited In (2)

• Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities
• Analytic approach to coset-leader decoding leads to extension of the Welch-Berlekamp theorem

This page was built for publication: Extension of Welch-Berlekamp theorem and universal strategy of decoding algorithm beyond BCH bound

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