中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
On error distance of Reed-Solomon codes

文献类型:期刊论文

作者Li YuJuan1; Wan DaQing2
刊名SCIENCE IN CHINA SERIES A-MATHEMATICS
出版日期2008-11-01
卷号51期号:11页码:1982-1988
关键词Reed-Solomon code error distance deep hole character sum
ISSN号1006-9283
DOI10.1007/s11425-008-0066-3
英文摘要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).
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000259820400003
出版者SCIENCE PRESS
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/6033]  
专题中国科学院数学与系统科学研究院
通讯作者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.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。