Bounds on the trellis size of linear block codes
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (1), 203-209
- https://doi.org/10.1109/18.179359
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Repeated-root cyclic codesIEEE Transactions on Information Theory, 1991
- Bit-level soft-decision decoding of Reed-Solomon codesIEEE Transactions on Communications, 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
- Efficient maximum likelihood decoding of linear block codes using a trellisIEEE Transactions on Information Theory, 1978
- Shortened BCH codes (Corresp.)IEEE Transactions on Information Theory, 1973