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 条
  • [41] Classification of binary covering codes
    Östergärd, PRJ
    Weakley, WD
    JOURNAL OF COMBINATORIAL DESIGNS, 2000, 8 (06) : 391 - 401
  • [42] Equivalence between the BCH bound and the schaub* bound for cyclic codes
    Zheng, Junru
    Kaida, Takayasu
    PROCEEDINGS OF 2006 IEEE INFORMATION THEORY WORKSHOP, 2006, : 29 - +
  • [43] NEW CLASS OF BINARY CODES CONSTRUCTED ON BASIS OF BCH CODES
    KASAHARA, M
    SUGIYAMA, Y
    HIRASAWA, S
    NAMEKAWA, T
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (05) : 582 - 585
  • [44] ON THE WEIGHTS OF THE ELEMENTS OF THE DUALS OF BINARY BCH CODES
    RODIER, F
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 539 : 384 - 389
  • [45] On the Generalized Covering Radii of Reed-Muller Codes
    Elimelech, Dor
    Wei, Hengjia
    Schwartz, Moshe
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (07) : 4378 - 4391
  • [46] On non-binary quantum BCH codes
    Ma, Zhi
    Lu, Xin
    Feng, Keqin
    Feng, Dengguo
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2006, 3959 : 675 - 683
  • [47] On some classes of linear codes over and their covering radii
    Chatouh, K.
    Guenda, K.
    Gulliver, T. Aaron
    Noui, L.
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2017, 53 (1-2) : 201 - 222
  • [48] Multi-covering radii of codes with rank metric
    Vasantha, WB
    Selvaraj, RS
    PROCEEDINGS OF 2002 IEEE INFORMATION THEORY WORKSHOP, 2002, : 215 - 215
  • [49] On covering radii and coset weight distributions of extremal binary self-dual codes of length 40
    Ozeki, M
    THEORETICAL COMPUTER SCIENCE, 2000, 235 (02) : 283 - 308
  • [50] CYCLIC AND BCH CODES WHOSE MINIMUM DISTANCE EQUALS THEIR MAXIMUM BCH BOUND
    Joaquin Bernal, Jose
    Bueno-Carreno, Diana H.
    Jacobo Simon, Juan
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2016, 10 (02) : 459 - 474
12345