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

共 11 条

[1] BOUNDS FOR EXPONENTIAL SUMS
CARLITZ, L
UCHIYAMA, S
[J]. DUKE MATHEMATICAL JOURNAL, 1957, 24 (01) : 37 - 41
[2] Deligne P, 1974, PUBL MATH-PARIS, V43, P273, DOI [10.1007/BF02684373, DOI 10.1007/BF02684373]
[3] Gorenstein D., 1960, INFORM CONTR, V3, P291
[4] ALL BINARY 3-ERROR-CORRECTING BCH CODES OF LENGTH 2M-1 HAVE COVERING RADIUS 5
HELLESETH, T
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (02) : 257 - 258
[5] ON THE COVERING RADIUS OF CYCLIC LINEAR CODES AND ARITHMETIC CODES
HELLESETH, T
[J]. DISCRETE APPLIED MATHEMATICS, 1985, 11 (02) : 157 - 173
[6] Macwilliams F. J., 1977, THEORY ERROR CORRECT
[7] MORENO CJ, UNPUB P AM MATH SOC
[8] SKOROBOGATOV AN, 1987, 3RD P INT WORKSH INF, P308
[9] ON THE COVERING RADIUS OF LONG BINARY BCH CODES
TIETAVAINEN, A
[J]. DISCRETE APPLIED MATHEMATICS, 1987, 16 (01) : 75 - 77
[10] TIETAVAINEN A, 1986, INT S INFORM THEORY, P40

← 1 2 →