Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/51189
DC Field | Value | |
---|---|---|
dc.title | Improved list decoding of generalized Reed-Solomon and alternant codes over rings | |
dc.contributor.author | Armand, M.A. | |
dc.date.accessioned | 2014-04-24T08:35:52Z | |
dc.date.available | 2014-04-24T08:35:52Z | |
dc.date.issued | 2004 | |
dc.identifier.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. | |
dc.identifier.issn | 21578097 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/51189 | |
dc.description.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. | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.description.sourcetitle | IEEE International Symposium on Information Theory - Proceedings | |
dc.description.page | 384- | |
dc.description.coden | PISTF | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple 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.