Efficient decoding of Reed-Solomon codes beyond half the minimum distance
Top Cited Papers
- 1 January 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 46 (1) , 246-257
- https://doi.org/10.1109/18.817522
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Decoding Reed-Solomon Codes Beyond Half the Minimum DistancePublished by Springer Nature ,2000
- Decoding of Reed Solomon Codes beyond the Error-Correction BoundJournal of Complexity, 1997
- Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner basesIEEE Transactions on Information Theory, 1995
- Effective Polynomial ComputationPublished by Springer Nature ,1993
- A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codesIEEE Transactions on Information Theory, 1991
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional arrayJournal of Symbolic Computation, 1988
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- A method for solving key equation for decoding goppa codesInformation and Control, 1975
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codesIEEE Transactions on Information Theory, 1964