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 条
  • [21] On the duals of binary BCH codes
    Voloch, JF
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (05) : 2050 - 2051
  • [22] The Generalized Covering Radii of Linear Codes
    Elimelech, Dor
    Firer, Marcelo
    Schwartz, Moshe
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 302 - 307
  • [23] The Generalized Covering Radii of Linear Codes
    Elimelech, Dor
    Firer, Marcelo
    Schwartz, Moshe
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (12) : 8070 - 8085
  • [24] On the Newton and covering radii of linear codes
    Gabidulin, E
    Klove, T
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (07) : 2534 - 2536
  • [25] Covering radius of self-complementary codes and BCH codes
    Laihonen, T
    1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 434 - 434
  • [26] On the covering radii of binary Reed-Muller codes in the set of resilient Boolean functions
    Borissov, Y
    Braeken, A
    Nikova, S
    Preneel, B
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (03) : 1182 - 1189
  • [27] An Improvement of the Asymptotic Elias Bound for Non-Binary Codes
    Kaipa, Krishna
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (07) : 5170 - 5178
  • [28] PARALLEL DECODING OF BINARY BCH CODES
    HWANG, T
    ELECTRONICS LETTERS, 1991, 27 (24) : 2223 - 2225
  • [29] INVERSIONLESS DECODING OF BINARY BCH CODES
    BURTON, HO
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1971, 17 (04) : 464 - +
  • [30] Decoding algoritmi for binary BCH codes
    Chr, CL
    Su, SL
    Wu, SW
    Proceedings of the IASTED International Conference Communication Systems and Networks, 2004, : 254 - 258
12345