AN ASYMPTOTIC BOUND ON THE COVERING RADII OF BINARY BCH CODES

被引：13
|
作者：
TIETAVAINEN, AA
机构：
[1] Department of Mathematics, University of Turku, SF-20500, Turku
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1990年 / 36卷 / 01期
关键词：
Codes; Symbolic;
D O I：
10.1109/18.50395
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Deligne's theorem is used to prove that the covering radius of a primitive binary BCH code with designed distance 2t+l is equal to 2t — 1 if t is of the form 2” + 1 and the code length is at least (2t)/sup 4t-2/. It is believed that this is the first time Deligne's theorem is used on coding theory. © 1990 IEEE
引用
下载
收藏
页码：211 / 213
页数：3
相关论文
共 50 条
12345