Jean–Pierre Tillich

Using Reed-Solomon codes in the (U | U + V ) construction and an application to cryptography

2016

In this paper we present a modification of Reed-Solomon codes that beats the Guruswami-Sudan 1 − √R decoding radius of Reed-Solomon codes at low rates R. The idea is to choose Reed-Solomon codes U and …