Decoding punctured Reed–Solomon codes up to the Singleton bound
Conference: SCC'08 - 7th International ITG Conference on Source and Channel Coding
01/14/2008 - 01/16/2008 at Ulm, Germany
Proceedings: SCC'08
Pages: 6Language: englishTyp: PDF
Personal VDE Members are entitled to a 10% discount on this title
Authors:
Sidorenko, Vladimir; Schmidt, Georg; Bossert, Martin (University of Ulm, Germany)
Abstract:
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 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, who considered list decoding of Folded Reed-Solomon codes up to their distance.