A Caltech Library Service

Performance enhancements for algebraic soft decision decoding of Reed-Solomon codes

El-Khamy, Mostafa and McEliece, Robert J. and Harel, Jonathan (2004) Performance enhancements for algebraic soft decision decoding of Reed-Solomon codes. In: 2004 IEEE International Symposium on Information Theory : proceedings : Chicago Downtown Marriott, Chicago, Illinois, USA, June 27-July 2, 2004. IEEE , Piscataway, NJ, p. 419. ISBN 0-7803-8280-3.

PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


In an attempt to determine the ultimate capabilities of the Sudan-Guruswami-Sudan-Kotter-Vardy algebraic soft decision decoding algorithm for Reed-Solomon codes, we present a new method, based on the Chernoff bound, for constructing multiplicity matrices. In many cases, this technique predicts that the potential performance of ASD decoding of RS codes is significantly better than previously thought.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 2006 IEEE. Reprinted with permission. This research was supported by NSF grant no. CCR-0118670 and grants from Sony, Qualcomm, and the Lee Center for Advanced Networking.
Funding AgencyGrant Number
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
Subject Keywords:Reed-Solomon codes; algebraic codes; decoding; matrix multiplication
Record Number:CaltechAUTHORS:ELKisit04
Persistent URL:
Official Citation:M. El-Khamy, R. J. McEliece and J. Harel, "Performance enhancements for algebraic soft decision decoding of Reed-Solomon codes," International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., Chicago, IL, 2004, pp. 421-. doi: 10.1109/ISIT.2004.1365456
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:3534
Deposited By: Archive Administrator
Deposited On:13 Jun 2006
Last Modified:08 Nov 2021 19:56

Repository Staff Only: item control page