A Link between Guruswami--Sudan's List--Decoding and Decoding of Interleaved Reed--Solomon Codes release_sjwjdyqt45eoxpea5h5agign34

by Alexander Zeh, Christian Senger

Released as a article .

2010  

Abstract

The Welch--Berlekamp approach for Reed--Solomon (RS) codes forms a bridge between classical syndrome--based decoding algorithms and interpolation--based list--decoding procedures for list size l=1. It returns the univariate error--locator polynomial and the evaluation polynomial of the RS code as a y-root. In this paper, we show the connection between the Welch--Berlekamp approach for a specific Interleaved Reed--Solomon code scheme and the Guruswami--Sudan principle. It turns out that the decoding of Interleaved RS codes can be formulated as a modified Guruswami--Sudan problem with a specific multiplicity assignment. We show that our new approach results in the same solution space as the Welch--Berlekamp scheme. Furthermore, we prove some important properties.
In text/plain format

Archived Files and Locations

application/pdf  351.7 kB
file_cw2rocds3zfubgywfceov4a674
arxiv.org (repository)
web.archive.org (webarchive)
application/pdf  351.7 kB
file_vqdxfnidprdfrlzdjs6de3zklm
core.ac.uk (web)
archive.org (archive)
web.archive.org (webarchive)
arxiv.org (repository)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2010-06-08
Version   v1
Language   en ?
arXiv  1006.1658v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 0364bae6-1eb5-4e1a-883d-4a1d1c565019
API URL: JSON