We consider interpolation-based decoding of Reed-Solomon codes using the Guruswami-Sudan algorithm (GSA) and investigate the effects of two modification techniques for received vectors, i.e., the re-encoding map and the newly introduced periodicity projection. After an analysis of the latter, we track the benefits of modified received vectors (that is low Hamming weight and regular structure) through the interpolation step of the GSA and show how the involved homogeneous linear system of equations can be compressed. We show that this compression as well as the recovery of the interpolated bivariate polynomial is particularly simple when the periodicity projection was applied.
%0 Conference Paper
%1 senger2014reencoding
%A Senger, Christian
%B 2014 27th Biennial Symposium on Communications (QBSC)
%D 2014
%I IEEE
%K sent ubs_10005 ubs_20007 ubs_30073 ubs_40406 unibibliografie
%P 203-207
%R 10.1109/QBSC.2014.6841214
%T Re-encoding techniques for interpolation-based decoding of Reed-Solomon codes
%X We consider interpolation-based decoding of Reed-Solomon codes using the Guruswami-Sudan algorithm (GSA) and investigate the effects of two modification techniques for received vectors, i.e., the re-encoding map and the newly introduced periodicity projection. After an analysis of the latter, we track the benefits of modified received vectors (that is low Hamming weight and regular structure) through the interpolation step of the GSA and show how the involved homogeneous linear system of equations can be compressed. We show that this compression as well as the recovery of the interpolated bivariate polynomial is particularly simple when the periodicity projection was applied.
%@ 978-1-4799-3972-5
@inproceedings{senger2014reencoding,
abstract = {We consider interpolation-based decoding of Reed-Solomon codes using the Guruswami-Sudan algorithm (GSA) and investigate the effects of two modification techniques for received vectors, i.e., the re-encoding map and the newly introduced periodicity projection. After an analysis of the latter, we track the benefits of modified received vectors (that is low Hamming weight and regular structure) through the interpolation step of the GSA and show how the involved homogeneous linear system of equations can be compressed. We show that this compression as well as the recovery of the interpolated bivariate polynomial is particularly simple when the periodicity projection was applied.},
added-at = {2020-03-11T15:51:43.000+0100},
author = {Senger, Christian},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2f531f645b058a9a38e603eb95c1ef34c/unibiblio},
booktitle = {2014 27th Biennial Symposium on Communications (QBSC)},
doi = {10.1109/QBSC.2014.6841214},
eventdate = {2014-06-01/2014-06-04},
eventtitle = {2014 27th Biennial Symposium on Communications (QBSC)},
interhash = {2bd6ae19ae15ef3e40bb3d7511acba23},
intrahash = {f531f645b058a9a38e603eb95c1ef34c},
isbn = {978-1-4799-3972-5},
keywords = {sent ubs_10005 ubs_20007 ubs_30073 ubs_40406 unibibliografie},
pages = {203-207},
publisher = {IEEE},
timestamp = {2020-03-11T14:51:43.000+0100},
title = {Re-encoding techniques for interpolation-based decoding of Reed-Solomon codes},
venue = {Kingston, ON, Canada},
year = 2014
}