A NEW LOWER BOUND FOR THE MINIMUM DISTANCE OF BINARY GOPPA CODES

被引：0
|
作者：
冯贵良 [1 ]
机构：
[1] Shanghai Institute of Computer Technology
来源：
Journal of Electronics(China) | 1985年 / 03期
关键词：
一刀; A NEW LOWER BOUND FOR THE MINIMUM DISTANCE OF BINARY GOPPA CODES; Za; 一夕; BCH;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Binary Goppa codes are a large and powerful family of error-correcting codes. But how tofind the true minimum distance of binary Goppa codes is not solved yet. In this paper a new lowerbound for the minimum distance of binary Goppa codes is shown. This new lower bound improvesthe results in Y. Sugiyama (1976) and Fang Guiliang’s (1983) papers. The method in this paper canbe generalized to other Goppa codes easily.
引用
收藏
页码：188 / 194
页数：7
相关论文
共 50 条
  • [21] New binary codes from extended Goppa codes
    M. Tomlinson
    M. Jibril
    C. Tjhai
    M. Grassl
    M. Z. Ahmed
    [J]. Designs, Codes and Cryptography, 2014, 70 : 149 - 156
  • [22] A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
    Zeh, Alexander
    Bezzateev, Sergey
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2014, 71 (02) : 229 - 246
  • [23] A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
    Alexander Zeh
    Sergey Bezzateev
    [J]. Designs, Codes and Cryptography, 2014, 71 : 229 - 246
  • [24] New upper bound on the minimum distance of turbo codes
    Perotti, A
    Benedetto, S
    [J]. 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 313 - 313
  • [25] A new upper bound on the minimum distance of turbo codes
    Perotti, A
    Benedetto, S
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (12) : 2985 - 2997
  • [26] A [55,16,19] BINARY GOPPA CODE AND RELATED CODES HAVING LARGE MINIMUM DISTANCE
    CAO, HT
    DOUGHERTY, RL
    JANWA, H
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (05) : 1432 - 1433
  • [27] List-Decoding of Binary Goppa Codes up to the Binary Johnson Bound
    Augot, Daniel
    Barbier, Morgan
    Couvreur, Alain
    [J]. 2011 IEEE INFORMATION THEORY WORKSHOP (ITW), 2011,
  • [28] A NEW LOWER BOUND FOR THE MINIMUM DISTANCE OF A CYCLIC CODE
    ROOS, C
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) : 330 - 332
  • [29] Decoding Cyclic Codes up to a New Bound on the Minimum Distance
    Zeh, Alexander
    Wachter-Zeh, Antonia
    Bezzateev, Sergey V.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (06) : 3951 - 3960
  • [30] On the minimum distance of binary concatenated codes
    Kohnosu, T
    Nishijima, T
    Hirasawa, S
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (05) : 922 - 923
12345