Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon Codes

Preprint

4 January 2007

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.cs/0701018

Abstract

We investigate the decoding region for Algebraic Soft-Decision Decoding (ASD) of Reed-Solomon codes in a discrete, memoryless, additive-noise channel. An expression is derived for the error correction radius within which the soft-decision decoder produces a list that contains the transmitted codeword. The error radius for ASD is shown to be larger than that of Guruswami-Sudan hard-decision decoding for a subset of low-rate codes. These results are also extended to multivariable interpolation in the sense of Parvaresh and Vardy. An upper bound is then presented for ASD's probability of error, where an error is defined as the event that the decoder selects an erroneous codeword from its list. This new definition gives a more accurate bound on the probability of error of ASD than the results available in the literature.

Keywords

All Related Versions

Version 1, 2007-01-04, ArXiv

This publication has 0 references indexed in Scilit: