Published July 2004 | Version Published
Book Section - Chapter Open

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

Abstract

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.

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.

Attached Files

Published - ELKisit04.pdf

Files

ELKisit04.pdf

Files (249.2 kB)

Name Size Download all
md5:284e06731b9068668c9908d79ec243ce
249.2 kB Preview Download

Additional details

Identifiers

Eprint ID
3534
Resolver ID
CaltechAUTHORS:ELKisit04

Funding

NSF
CCR-0118670
Sony
Qualcomm Inc.
Caltech Lee Center for Advanced Networking

Dates

Created
2006-06-13
Created from EPrint's datestamp field
Updated
2021-11-08
Created from EPrint's last_modified field