Avoiding decoder malfunction in the Peterson-Gorenstein-Zierler decoder

DOI10.1109/18.212296MaRDI QIDQ4202090zbMATH OpenOpenAlexFDO

Authors Arne Dür

Publication date 16 September 1993

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

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

zbMATH Keywords

BCH decodersbounded-distance decoderdecoder malfunctionPeterson- Gorenstein-Zierler algorithmReed-Solomon coding

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Recommendations

• Malfunction in the Peterson-Gorenstein-Zierler decoder
• Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations
• Decoder malfunction in BCH decoders
• A simple decoding of BCH codes over GF(2ᵐ)
• Simple algorithms for BCH decoding

Cited in

(2)

• A novel low-cost multi-mode Reed Solomon decoder design based on Peterson-Gorenstein-Zierler algorithm
• Malfunction in the Peterson-Gorenstein-Zierler decoder

This page was built for publication: Avoiding decoder malfunction in the Peterson-Gorenstein-Zierler decoder

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