On error distance of Reed-Solomon codes

doi:10.1007/s11425-008-0066-3

CSpace

	On error distance of Reed-Solomon codes
	Li YuJuan 1; Wan DaQing 2
	2008-11-01
发表期刊	SCIENCE IN CHINA SERIES A-MATHEMATICS
ISSN	1006-9283
卷号	51 期号:11 页码:1982-1988
摘要	The complexity of decoding the standard Reed-Solomon code is a well known open problem 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).
关键词	Reed-Solomon code error distance deep hole character sum
DOI	10.1007/s11425-008-0066-3
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied ; Mathematics
WOS记录号	WOS:000259820400003
出版者	SCIENCE PRESS
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/6034
专题	中国科学院数学与系统科学研究院
通讯作者	Li YuJuan
作者单位	1.Chinese Acad Sci, Inst Math, Beijing 100080, Peoples R China 2.Univ Calif Irvine, Dept Math, Irvine, CA 92697 USA
推荐引用方式 GB/T 7714	Li YuJuan,Wan DaQing. On error distance of Reed-Solomon codes[J]. SCIENCE IN CHINA SERIES A-MATHEMATICS,2008,51(11):1982-1988.
APA	Li YuJuan,&Wan DaQing.(2008).On error distance of Reed-Solomon codes.SCIENCE IN CHINA SERIES A-MATHEMATICS,51(11),1982-1988.
MLA	Li YuJuan,et al."On error distance of Reed-Solomon codes".SCIENCE IN CHINA SERIES A-MATHEMATICS 51.11(2008):1982-1988.