Bounded distance+1 soft-decision Reed-Solomon decoding
- 1 May 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 42 (3) , 704-720
- https://doi.org/10.1109/18.490539
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- A New Efficient Error-Erasure Location Scheme in Gmd DecodingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A new Reed-Solomon code decoding algorithm based on Newton's interpolationIEEE Transactions on Information Theory, 1993
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978
- On the complexity of decoding Reed-Solomon codes (Corresp.)IEEE Transactions on Information Theory, 1976
- A method for solving key equation for decoding goppa codesInformation and Control, 1975
- Adding Two Information Symbols to Certain Nonbinary BCH Codes and Some ApplicationsBell System Technical Journal, 1969
- Some results on cyclic codes which are invariant under the affine group and their applicationsInformation and Control, 1967
- A lower bound to the distribution of computation for sequential decodingIEEE Transactions on Information Theory, 1967
- Generalized minimum distance decodingIEEE Transactions on Information Theory, 1966
- A heuristic discussion of probabilistic decodingIEEE Transactions on Information Theory, 1963