Probabilistic Analysis of LLL-based Decoder of Interleaved Chinese Remainder Codes
Abstract
To date, Li et al. have presented the only decoder for Interleaved Chinese Remainder (ICR) codes [1]. The core of their ICR decoder is to find a short vector in a lattice using the LLL algorithm [2]. However, their analysis of the decoding failure is partially heuristic. In this work, we present a new analysis of their LLL-based decoder that gives a proved upper bound on its decoding failure probability.
Domains
Information Theory [cs.IT]| Origin | Files produced by the author(s) |
|---|---|
| Licence |
