Maximum-likelihood soft decision decoding of BCH codes
- 1 March 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 40 (2) , 546-554
- https://doi.org/10.1109/18.312184
Abstract
The problem of efficient maximum-likelihood soft decision decoding of binary BCH codes is considered. It is known that those primitive BCH codes whose designed distance is one less than a power of two, contain subcodes of high dimension which consist of a direct-sum of several identical codes. The authors show that the same kind of direct-sum structure exists in all the primitive BCH codes, as well as in the BCH codes of composite block length. They also introduce a related structure termed the “concurring-sum”, and then establish its existence in the primitive binary BCH codes. Both structures are employed to upper bound the number of states in the minimal trellis of BCH codes, and develop efficient algorithms for maximum-likelihood soft decision decoding of these codesKeywords
This publication has 19 references indexed in Scilit:
- On Complexity Of Trellis Structure Of Linear Block CodesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Soft trellis-based decoder for linear block codesIEEE Transactions on Information Theory, 1994
- On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codesIEEE Transactions on Information Theory, 1993
- Bounds on the trellis size of linear block codesIEEE Transactions on Information Theory, 1993
- On the generalized Hamming weights of several classes of cyclic codsIEEE Transactions on Information Theory, 1992
- On the problem of finding zero-concurring codewordsIEEE Transactions on Information Theory, 1991
- Maximum likelihood soft decoding of binary block codes and decoders for the Golay codesIEEE Transactions on Information Theory, 1989
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Minimal trellises for block codesIEEE Transactions on Information Theory, 1988
- Soft decoding techniques for codes and lattices, including the Golay code and the Leech latticeIEEE Transactions on Information Theory, 1986