Please use this identifier to cite or link to this item:
|Title:||Multistage list decoding of generalized Reed-Solomon codes over Galois rings||Authors:||Armand, M.A.
de Taisne, O.
|Issue Date:||Jul-2005||Citation:||Armand, M.A.,de Taisne, O. (2005-07). Multistage list decoding of generalized Reed-Solomon codes over Galois rings. IEEE Communications Letters 9 (7) : 625-627. ScholarBank@NUS Repository. https://doi.org/10.1109/LCOMM.2005.07012||Abstract:||A two-stage list decoder for generalized Reed-Solomon codes over GR(pl, m) that can exceed the Guruswami-Sudan decoding radius tGS with significant probability for p = 2, l ≥ 2 and m = 1 was recently proposed. It makes a distinction between error values which are units and those which are zero divisors in order to exceed tGS. This letter presents an extension of that approach by exploiting the fact that each element of GR(pl, m) has a unique p-adic expansion, culminating in a multistage decoder that outperforms the two-stage decoder. © 2005 IEEE.||Source Title:||IEEE Communications Letters||URI:||http://scholarbank.nus.edu.sg/handle/10635/82737||ISSN:||10897798||DOI:||10.1109/LCOMM.2005.07012|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 21, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.