Please use this identifier to cite or link to this item:
|Title:||List decoding of generalized Reed-Solomon codes over commutative rings|
Reed-Solomon codes (RS)
|Source:||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|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 17, 2018
WEB OF SCIENCETM
checked on Nov 16, 2017
checked on Jan 14, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.