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

From MaRDI portal
Publication:3604940

DOI10.1109/TIT.2008.929969zbMATH Open1319.94110arXivcs/0701018OpenAlexW2012846174MaRDI QIDQ3604940FDOQ3604940

Andrew Duggan, Alexander Barg

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/cs/0701018






Cited In (5)


Recommendations





This page was built for publication: Performance Analysis of Algebraic Soft-Decision Decoding of Reed–Solomon Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604940)