FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
Fingerprinting Concatenated Codes with Efficient Identification
ISC '02 Proceedings of the 5th International Conference on Information Security
Towards a VLSI Architecture for Interpolation-Based Soft-Decision Reed-Solomon Decoders
Journal of VLSI Signal Processing Systems
Fast factorization architecture in soft-decision Reed-Solomon decoding
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Partial parallel factorization in soft-decision Reed-Solomon decoding
GLSVLSI '06 Proceedings of the 16th ACM Great Lakes symposium on VLSI
High-speed interpolation architecture for soft-decision decoding of Reed-Solomon codes
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Low-latency factorization architecture for algebraic soft-decision decoding of Reed-Solomon codes
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Technical perspective: The beauty of error-correcting codes
Communications of the ACM - Being Human in the Digital Age
Error correction up to the information-theoretic limit
Communications of the ACM - Being Human in the Digital Age
List Decoding of Binary Codes---A Brief Survey of Some Recent Results
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
IEEE Transactions on Communications
Reed-Solomon codes implementing a coded single-carrier with cyclic prefix scheme
IEEE Transactions on Communications
High performance non-binary quasi-cyclic LDPC codes on euclidean geometries
IEEE Transactions on Communications
Soft-decision list decoding of hermitian codes
IEEE Transactions on Communications
Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions
IEEE Transactions on Communications
Multiplicity assignments for algebraic soft-decoding of Reed-Solomon codes using the method of types
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
IEEE Journal on Selected Areas in Communications
Subcodes of Reed-Solomon codes suitable for soft decoding
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
A rate-distortion perspective on multiple decoding attempts for Reed-Solomon codes
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
A low complexity iterative technique for soft decision decoding of reed-solomon codes
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Quasi-cyclic LDPC codes: an algebraic construction
IEEE Transactions on Communications
Algebraic soft-decision decoding of Hermitian codes
IEEE Transactions on Information Theory
M-ary hyper phase-shift keying with Reed Solomon encoding and soft decision reliability information
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Minimum distance decoding of general algebraic geometry codes via lists
IEEE Transactions on Information Theory
A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
Information Processing Letters
Stochastic chase decoding of reed-Solomon codes
IEEE Communications Letters
Code automorphisms and permutation decoding of certain Reed-Solomon binary images
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
High-throughput interpolation architecture for algebraic soft-decision Reed-Solomon decoding
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Algebraic soft-decision decoder architectures for long Reed-Solomon codes
IEEE Transactions on Circuits and Systems II: Express Briefs
Two low-complexity reliability-based message-passing algorithms for decoding non-binary LDPC codes
IEEE Transactions on Communications
EXIT function aided design of iteratively decodable codes for the poisson PPM channel
IEEE Transactions on Communications
Reduced complexity interpolation architecture for soft-decision reed-solomon decoding
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Backward interpolation architecture for algebraic soft-decision reed-solomon decoding
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
List decoding of generalized reed-solomon codes by using a modified extended key equation algorithm
EURASIP Journal on Wireless Communications and Networking
Fingerprinting schemes. identifying the guilty sources using side information
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
Computing gröbner bases for vanishing ideals of finite sets of points
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Modified Low-Complexity Chase Soft-Decision Decoder of Reed---Solomon Codes
Journal of Signal Processing Systems
Efficient Generalized Minimum-distance Decoders of Reed-Solomon Codes
Journal of Signal Processing Systems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A minimal search soft decision list decoding algorithm for Reed-Solomon codes
International Journal of Information and Communication Technology
| Hi-index | 755.08 |
A polynomial-time soft-decision decoding algorithm for Reed-Solomon codes is developed. This list-decoding algorithm is algebraic in nature and builds upon the interpolation procedure proposed by Guruswami and Sudan(see ibid., vol.45, p.1757-67, Sept. 1999) for hard-decision decoding. Algebraic soft-decision decoding is achieved by means of converting the probabilistic reliability information into a set of interpolation points, along with their multiplicities. The proposed conversion procedure is shown to be asymptotically optimal for a certain probabilistic model. The resulting soft-decoding algorithm significantly outperforms both the Guruswami-Sudan decoding and the generalized minimum distance (GMD) decoding of Reed-Solomon codes, while maintaining a complexity that is polynomial in the length of the code. Asymptotic analysis for alarge number of interpolation points is presented, leading to a geo- metric characterization of the decoding regions of the proposed algorithm. It is then shown that the asymptotic performance can be approached as closely as desired with a list size that does not depend on the length of the code.