List decoding of generalized Reed-Solomon codes over commutative rings

Please use this identifier to cite or link to this item: https://doi.org/10.1109/TIT.2004.839546

Title:	List decoding of generalized Reed-Solomon codes over commutative rings
Authors:	Armand, M.A.
Keywords:	Interpolation List decoding Post-processor Reed-Solomon codes (RS) Soft-decision decoding
Issue Date:	Jan-2005
Citation:	Armand, M.A. (2005-01). List decoding of generalized Reed-Solomon codes over commutative rings. IEEE Transactions on Information Theory 51 (1) : 411-419. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2004.839546
Abstract:	We show that the list decoding procedure of Guruswami and Sudan may be used to decode generalized Reed-Solomon (RS) codes defined over commutative rings with identity. An algorithm for performing the first of the two phases of this decoding procedure is also given. In particular, we show that for generalized RS codes over chain rings, the probability of picking an incorrect codeword from a given list can be reduced by increasing the size of the code alphabet while keeping the length and minimum (Hamming) distance of the code constant. © 2005 IEEE.
Source Title:	IEEE Transactions on Information Theory
URI:	http://scholarbank.nus.edu.sg/handle/10635/56503
ISSN:	00189448
DOI:	10.1109/TIT.2004.839546
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check