TY - GEN
T1 - Decoding punctured Reed-Solomon codes up to the Singleton bound
AU - Sidorenko, Vladimir
AU - Schmidt, Georg
AU - Bossert, Martin
PY - 2008
Y1 - 2008
N2 - We show that punctured Reed-Solomon codes can be decoded virtually up to the Singleton bound with computational complexity quadratic in the code length using our algorithm [1, 2] based on multi-sequence shift-register synthesis. Our decoder may fail, but the probability of a decoding failure can be made negligibly small. We compare our results with the ones of Guruswami-Rudra [3], who considered list decoding of Folded Reed-Solomon codes up to their distance.
AB - We show that punctured Reed-Solomon codes can be decoded virtually up to the Singleton bound with computational complexity quadratic in the code length using our algorithm [1, 2] based on multi-sequence shift-register synthesis. Our decoder may fail, but the probability of a decoding failure can be made negligibly small. We compare our results with the ones of Guruswami-Rudra [3], who considered list decoding of Folded Reed-Solomon codes up to their distance.
UR - http://www.scopus.com/inward/record.url?scp=85006757702&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85006757702
T3 - 7th International ITG Conference on Source and Channel Coding, SCC 2008
BT - 7th International ITG Conference on Source and Channel Coding, SCC 2008
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 7th International ITG Conference on Source and Channel Coding, SCC 2008
Y2 - 14 January 2008 through 16 January 2008
ER -