Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/51189
| Title: | Improved list decoding of generalized Reed-Solomon and alternant codes over rings | Authors: | Armand, M.A. | Issue Date: | 2004 | Citation: | Armand, M.A. (2004). Improved list decoding of generalized Reed-Solomon and alternant codes over rings. IEEE International Symposium on Information Theory - Proceedings : 384-. ScholarBank@NUS Repository. | Abstract: | We present a simple modification to the Guruswami-Sudan list decoding algorithm to exceed the decoding radius of the original algorithm. It exploits the presence of non-trivial zero divisors in the code alphabet and is applicable, but not limited to, generalized Reed-Solomon codes over Galois rings and their subring subcodes. | Source Title: | IEEE International Symposium on Information Theory - Proceedings | URI: | http://scholarbank.nus.edu.sg/handle/10635/51189 | ISSN: | 21578097 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.