arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1001.2463cs.ITcs.DMmath.IT
收藏

关于最大距离可分码的门限

On the Threshold of Maximum-Distance Separable Codes

Bruno Kindarji, Gérard Cohen, Hervé Chabanne

摘要:

本文从Reed-Solomon码在Indocrypt'09发表的一个密码体制中的实际应用出发,讨论了线性$q$ -元纠错码的门限问题。该方案的安全性是基于当向量中存在太多噪声时多项式重构的困难性。我们的方法从这种范式切换到信息理论的角度来看:是否有一类元素是如此远离代码的列表大小总是超多项式?或者,双重地说,最大似然解码几乎肯定是不可能的?我们把这个问题与码的译码门限联系起来,证明了当码的最小距离足够大时,门限效应是非常明显的。在第二部分中,我们明确的最大距离可分离码,如里德-所罗门码的阈值上的下限,并计算激励本研究的玩具的例子的阈值。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑