Soft trellis-based decoder for linear block codes
- 1 May 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 40 (3) , 764-773
- https://doi.org/10.1109/18.335888
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- More efficient soft decoding of the Golay codesIEEE Transactions on Information Theory, 1991
- On the problem of finding zero-concurring codewordsIEEE Transactions on Information Theory, 1991
- Bounds on the dimension of codes and subcodes with prescribed contraction indexLinear Algebra and its Applications, 1990
- 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
- Optimal soft decision block decoders based on fast Hadamard transformIEEE Transactions on Information Theory, 1986
- The construction of fast, high-rate, soft decision block decodersIEEE Transactions on Information Theory, 1983
- Class of algorithms for decoding block codes with channel measurement informationIEEE Transactions on Information Theory, 1972
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithmIEEE Transactions on Information Theory, 1967