Bit-level soft-decision decoding of Reed-Solomon codes
- 1 March 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 39 (3), 440-444
- https://doi.org/10.1109/26.79287
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Bounds on the bit error probability of a linear cyclic code over GF(2/sup l/) and its extended codeIEEE Transactions on Information Theory, 1988
- The Design of a High-Performance Error-Correcting Coding Scheme for the Canadian Broadcast Telidon System Based on Reed-Solomon CodesIEEE Transactions on Communications, 1987
- A Recursive Hadamard Transform Optimal Soft Decision Decoding AlgorithmSIAM Journal on Algebraic Discrete Methods, 1987
- Optimal soft decision block decoders based on fast Hadamard transformIEEE Transactions on Information Theory, 1986
- Soft decoding techniques for codes and lattices, including the Golay code and the Leech latticeIEEE Transactions on Information Theory, 1986
- Performance of Reed-Solomon Coded Frequency-Hop Spread-Spectrum Communications in Partial-Band InterferenceIEEE Transactions on Communications, 1985
- PPM Performance for Reed-Solomon Decoding Over an Optical-RF Relay LinkIEEE Transactions on Communications, 1984
- Efficient maximum likelihood decoding of linear block codes using a trellisIEEE Transactions on Information Theory, 1978
- Generalized minimum distance decodingIEEE Transactions on Information Theory, 1966