Skip to main navigation Skip to search Skip to main content

On decoding Interleaved Chinese Remainder codes

  • University of Ulm
  • Technical University of Denmark

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

We model the decoding of Interleaved Chinese Remainder codes as that of finding a short vector in a Z-lattice. Using the LLL algorithm, we obtain an efficient decoding algorithm, correcting errors beyond the unique decoding bound and having nearly linear complexity. The algorithm can fail with a probability dependent on the number of errors, and we give an upper bound for this. Simulation results indicate that the bound is close to the truth. We apply the proposed decoding algorithm for decoding a single CR code using the idea of 'Power' decoding, suggested for Reed-Solomon codes. A combination of these two methods can be used to decode low-rate Interleaved Chinese Remainder codes.

Original languageEnglish
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages1052-1056
Number of pages5
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: 7 Jul 201312 Jul 2013

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2013 IEEE International Symposium on Information Theory, ISIT 2013
Country/TerritoryTurkey
CityIstanbul
Period7/07/1312/07/13

Keywords

  • Interleaved Chinese Remainder codes
  • Lattice reduction
  • Power decoding

Fingerprint

Dive into the research topics of 'On decoding Interleaved Chinese Remainder codes'. Together they form a unique fingerprint.

Cite this