Li, Wenhui2; Sidorenko, Vladimir2; Nielsen, Johan Sebastian Rosenkilde1
1 Department of Applied Mathematics and Computer Science, Technical University of Denmark2 Ulm University
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.
2013 Ieee International Symposium on Information Theory Proceedings (isit), 2013, p. 1052-1056
Main Research Area:
IEEE International Symposium on Information Theory (ISIT 2013)