Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/51189
DC FieldValue
dc.titleImproved list decoding of generalized Reed-Solomon and alternant codes over rings
dc.contributor.authorArmand, M.A.
dc.date.accessioned2014-04-24T08:35:52Z
dc.date.available2014-04-24T08:35:52Z
dc.date.issued2004
dc.identifier.citationArmand, 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.issn21578097
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/51189
dc.description.abstractWe 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.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.sourcetitleIEEE International Symposium on Information Theory - Proceedings
dc.description.page384-
dc.description.codenPISTF
dc.identifier.isiutNOT_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.