Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Performance Enhancements for Algebraic Soft Decision Decoding of Reed-Solomon Codes1
 

Summary: Performance Enhancements for Algebraic Soft Decision
Decoding of Reed-Solomon Codes1
Mostafa El-Khamy, Robert J. McEliece, and Jonathan Harel
California Institute of Technology
Pasadena, CA 91125, USA
{mostafa, rjm, harel}@systems.caltech.edu
Abstract -- In an attempt to determine the ultimate
capabilities of the Sudan/Guruswami-Sudan/KĻotter-
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.
I. Introduction
Through the seminal work of Guruswami-Sudan (GS) [1],
and KĻotter-Vardy (KV) [2], we now have a polynomial-time
algebraic soft decision (ASD) decoding algorithm for Reed-
Solomon codes. In this paper we offer a methodology for as-
signing multiplicities used by the GS algorithm and thus an

  

Source: Adolphs, Ralph - Psychology and Neuroscience, California Institute of Technology

 

Collections: Biology and Medicine