加载中…
2004-05-05
On the List and Bounded Distance Decodibility of the Reed-Solomon Codes
Qi ChengDaqing Wan
文献摘要
In this paper show that the list and bounded-distance decoding problems of certain bounds for the Reed-Solomon code are at least as hard as the discrete logarithm problem over finite fields.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本