Please use this identifier to cite or link to this item:
|Title:||Interleaved Reed-Solomon codes versus interleaved Hermitian codes|
|Keywords:||Algebraic geometry codes|
|Citation:||Armand, M.A. (2008). Interleaved Reed-Solomon codes versus interleaved Hermitian codes. IEEE Communications Letters 12 (10) : 779-781. ScholarBank@NUS Repository. https://doi.org/10.1109/LCOMM.2008.080716|
|Abstract:||Recently, Bleichenbacher et. al. introduced a collaborative decoding technique to jointly decode the constituent Reed-Solomon (RS) codes of an interleaved RS code. Brown et. al. subsequently generalized their approach to decode interleaved algebraic geometry codes. We identify when interleaved Hermitian codes enable recovery from more errors compared to interleaved RS codes of the same length, rate and alphabet size, under the aforementioned collaborative decoding schemes. Our investigations consider a wide range of code rates and alphabet sizes as well as codelengths of practical interest. © 2008 IEEE.|
|Source Title:||IEEE Communications Letters|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 5, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.