Decoding interleaved Reed-Solomon codes over noisy channels

14Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

We consider error correction over the Non-Binary Symmetric Channel (NBSC) which is a natural probabilistic extension of the Binary Symmetric Channel (BSC). We propose a new decoding algorithm for interleaved Reed-Solomon codes that attempts to correct all "interleaved" codewords simultaneously. In particular, interleaved encoding gives rise to multi-dimensional curves and more specifically to a variation of the Polynomial Reconstruction Problem, which we call Simultaneous Polynomial Reconstruction. We present and analyze a novel probabilistic algorithm that solves this problem. Our construction yields a decoding algorithm for interleaved RS codes that allows efficient transmission arbitrarily close to the channel capacity in the NBSC model. © 2007 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Bleichenbacher, D., Kiayias, A., & Yung, M. (2007). Decoding interleaved Reed-Solomon codes over noisy channels. Theoretical Computer Science, 379(3), 348–360. https://doi.org/10.1016/j.tcs.2007.02.043

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free