Computer Science – Information Theory
Scientific paper
2010-01-14
Computer Science
Information Theory
Sumitted to ISIT 2010
Scientific paper
Starting from a practical use of Reed-Solomon codes in a cryptographic scheme published in Indocrypt'09, this paper deals with the threshold of linear $q$-ary error-correcting codes. The security of this scheme is based on the intractability of polynomial reconstruction when there is too much noise in the vector. Our approach switches from this paradigm to an Information Theoretical point of view: is there a class of elements that are so far away from the code that the list size is always superpolynomial? Or, dually speaking, is Maximum-Likelihood decoding almost surely impossible? We relate this issue to the decoding threshold of a code, and show that when the minimal distance of the code is high enough, the threshold effect is very sharp. In a second part, we explicit lower-bounds on the threshold of Maximum-Distance Separable codes such as Reed-Solomon codes, and compute the threshold for the toy example that motivates this study.
Chabanne Herve
Cohen Gérard
Kindarji Bruno
No associations
LandOfFree
On the Threshold of Maximum-Distance Separable Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Threshold of Maximum-Distance Separable Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Threshold of Maximum-Distance Separable Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-568294