Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities

DOI10.1109/18.21263zbMath0665.94024OpenAlexW2069596572MaRDI QIDQ3818254

Patrick Stevens

Publication date: 1989

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

Full work available at URL: https://semanticscholar.org/paper/fdc45eb7385cb71bc6f5324d86ac68ea52a2f33d

zbMATH Keywords

error correctionBCH boundHartmann-Tzeng boundBCH algorithmbinary cyclic linear unequal error protection codesconventional binary cyclic codes

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Related Items (1)

A Very Low Cost BCH Decoder for High Immunity of On-Chip Memories

This page was built for publication: Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities