On error distance of Reed-Solomon codes
摘要
The complexity of decoding the standard Reed-Solomon code is a well known open prob-lem in coding theory. The main problem is to compute the error distance of a received word. Using the Weil bound for character sum estimate, we show that the error distance can be determined precisely when the degree of the received word is small. As an application of our method, we give a significant improvement of the recent bound of Cheng-Murray on non-existence of deep holes (words with maximal error distance).
引用本文（GB/T 7714）
Li Yu. On error distance of Reed-Solomon codes[J]. 未知来源, 2008.
引文网络
本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。