1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1109/LCOMM.2007.070821
DC FieldValue
dc.titleChase decoding of linear ℤ4 codes at low to moderate rates
dc.contributor.authorArmand, M.A.
dc.contributor.authorHalim, A.
dc.contributor.authorNallanathan, A.
dc.date.accessioned2014-10-07T04:24:49Z
dc.date.available2014-10-07T04:24:49Z
dc.date.issued2007-10
dc.identifier.citationArmand, M.A., Halim, A., Nallanathan, A. (2007-10). Chase decoding of linear ℤ4 codes at low to moderate rates. IEEE Communications Letters 11 (10) : 811-813. ScholarBank@NUS Repository. https://doi.org/10.1109/LCOMM.2007.070821
dc.identifier.issn10897798
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/82052
dc.description.abstractA free ℤ4 code C may be decoded by decoding its canonical image C̄ over ℤ2 twice in succession. Hence, a Chase decoder for C could employ as its hard-decision (HD) decoder, a two-stage decoder which performs HD decoding on C̄ in each stage. Alternatively, one could have a two-stage soft-decision decoder by employing a Chase decoder for C̄ in each stage. We demonstrate that the latter approach can offer a significant reduction in complexity over the other, with little or no price to pay in terms of word error rate performance, particularly at low to moderate code rates. © 2007 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/LCOMM.2007.070821
dc.sourceScopus
dc.subjectℤ4 codes
dc.subjectBCH codes
dc.subjectChase decoding
dc.typeArticle
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/LCOMM.2007.070821
dc.description.sourcetitleIEEE Communications Letters
dc.description.volume11
dc.description.issue10
dc.description.page811-813
dc.description.codenICLEF
dc.identifier.isiut000250290200015
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.