Simple algorithms for BCH decoding

DOI10.1109/26.403765MaRDI QIDQ4849732zbMATH OpenOpenAlexWikidataFDO

Authors Jonathan Hong, Martin Vetterli

Publication date 22 April 1996

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL http://infoscience.epfl.ch/record/33884

zbMATH Keywords

complexitydecoding BCH codeserror valuesForney algorithmGaussian eliminationpruned FFTroots of error-locator polynomials

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25) Cyclic codes (94B15) Decoding (94B35)

Recommendations

• A simple decoding of BCH codes over GF(2ᵐ)
• On algebraic soft-decision decoding algorithms for BCH codes
• scientific article; zbMATH DE number 1559532
• Decoding beyond the BCH bound (Corresp.)

Cited in

(12)

• An improved algorithm for Davida amd Cowles's decoding method
• A complete decoding algorithm for double-error-correcting primitive binary BCH codes of odd m
• The generalized Goertzel algorithm and its parallel hardware implementation
• A simple decoding of BCH codes over GF(2ᵐ)
• Finding BCH error locator polynomials in one step
• Decoder malfunction in BCH decoders
• scientific article; zbMATH DE number 4095379 (Why is no real title available?)
• Avoiding decoder malfunction in the Peterson-Gorenstein-Zierler decoder
• On Blahut's decoding algorithms for two-dimensional BCH codes
• scientific article; zbMATH DE number 1559532 (Why is no real title available?)
• Some remarks on an algorithm of Fitzpatrick
• Decoding beyond the BCH bound (Corresp.)

This page was built for publication: Simple algorithms for BCH decoding

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