Optimal sectionalization of a trellis
- 1 May 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 42 (3) , 689-703
- https://doi.org/10.1109/18.490504
Abstract
No abstract availableThis publication has 28 references indexed in Scilit:
- Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech latticeIEEE Transactions on Information Theory, 1995
- Maximum-likelihood soft decision decoding of BCH codesIEEE Transactions on Information Theory, 1994
- Dimension/length profiles and trellis complexity of linear block codesIEEE Transactions on Information Theory, 1994
- The Nordstrom-Robinson code: representation over GF(4) and efficient decodingIEEE Transactions on Information Theory, 1994
- Maximum likelihood decoding of the Leech latticeIEEE Transactions on Information Theory, 1993
- More efficient soft decoding of the Golay codesIEEE Transactions on Information Theory, 1991
- Bit-level soft-decision decoding of Reed-Solomon codesIEEE Transactions on Communications, 1991
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Efficient maximum likelihood decoding of linear block codes using a trellisIEEE Transactions on Information Theory, 1978
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithmIEEE Transactions on Information Theory, 1967