An algebraic procedure for decoding beyond e/sub BCH/

DOI10.1109/18.485737zbMATH Open0854.94018OpenAlexW2094612402MaRDI QIDQ4885701FDOQ4885701

Authors: J. E. M. Nilsson 

Publication date: 22 January 1997

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

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

Recommendations

• Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e<e/sub BCH/
• Decoding beyond the BCH bound (Corresp.)
• Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities
• Decoding beyond the designed distance for certain algebraic codes
• Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations

zbMATH Keywords

BCH bounddecodingindicators

Mathematics Subject Classification ID

Decoding (94B35)

Cited In (5)

• Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities
• Title not available (Why is that?)
• High-Rate, Multisymbol-Decodable STBCs From Clifford Algebras
• Extension of Welch-Berlekamp theorem and universal strategy of decoding algorithm beyond BCH bound
• Title not available (Why is that?)

This page was built for publication: An algebraic procedure for decoding beyond e/sub BCH/

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