Please use this identifier to cite or link to this item: https://doi.org/10.1109/LCOMM.2008.080716
DC FieldValue
dc.titleInterleaved Reed-Solomon codes versus interleaved Hermitian codes
dc.contributor.authorArmand, M.A.
dc.date.accessioned2014-06-17T02:53:56Z
dc.date.available2014-06-17T02:53:56Z
dc.date.issued2008
dc.identifier.citationArmand, 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
dc.identifier.issn10897798
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/56380
dc.description.abstractRecently, 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/LCOMM.2008.080716
dc.sourceScopus
dc.subjectAlgebraic geometry codes
dc.subjectCollaborative decoding
dc.subjectHermitian codes
dc.subjectInterleaved codes
dc.subjectReed-Solomon codes
dc.typeArticle
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/LCOMM.2008.080716
dc.description.sourcetitleIEEE Communications Letters
dc.description.volume12
dc.description.issue10
dc.description.page779-781
dc.description.codenICLEF
dc.identifier.isiut000260000200027
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.