Lower bound of covering radius of binary irreducible Goppa codes

被引：3
|
作者：
Bezzateev, Sergey [1 ]
Shekhunova, Natalia [1 ]
机构：
[1] St Petersburg State Univ Aerosp Instrumentat, St Petersburg, Russia
来源：
DESIGNS CODES AND CRYPTOGRAPHY | 2017年 / 82卷 / 1-2期
关键词：
Goppa codes; Covering radius; Lower bound;
D O I：
10.1007/s10623-015-0173-4
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The lower bound of covering radius of binary irreducible Goppa codes is obtained.
引用
收藏
页码：69 / 76
页数：8
相关论文
共 50 条
  • [1] Lower bound of covering radius of binary irreducible Goppa codes
    Sergey Bezzateev
    Natalia Shekhunova
    [J]. Designs, Codes and Cryptography, 2017, 82 : 69 - 76
  • [2] Lower Bounds on the Covering Radius of the Non-Binary and Binary Irreducible Goppa Codes
    BezzateeV, Sergey V.
    Shekhunova, Natalia A.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (11) : 7171 - 7177
  • [3] On the covering radius of long goppa codes
    LevyditVehel, F
    Litsyn, S
    [J]. APPLIED ALGEBRA, ALGEBRAIC ALGORITHMS AND ERROR-CORRECTING CODES, 1995, 948 : 341 - 346
  • [4] Upper bound on the number of inequivalent extended binary irreducible Goppa codes
    Huang, Daitao
    Yue, Qin
    [J]. DISCRETE MATHEMATICS, 2024, 347 (01)
  • [5] A NEW LOWER BOUND FOR THE MINIMUM DISTANCE OF BINARY GOPPA CODES
    冯贵良
    [J]. Journal of Electronics(China), 1985, (03) : 188 - 194
  • [6] Extended Irreducible Binary Sextic Goppa Codes
    Huang, Daitao
    Yue, Qin
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (01) : 230 - 237
  • [7] Enumeration of Extended Irreducible Binary Goppa Codes
    Chen, Bocong
    Zhang, Guanghui
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (08) : 5145 - 5153
  • [8] The Number of Extended Irreducible Binary Goppa Codes
    Chen, Bocong
    Zhang, Guanghui
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (12) : 7691 - 7711
  • [9] Lower bounds for binary codes of covering radius one
    Haas, Wolfgang
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (08) : 2880 - 2881
  • [10] ON THE COVERING RADIUS OF BINARY, LINEAR CODES MEETING THE GRIESMER BOUND
    BUSSCHBACH, PB
    GERRETZEN, MGL
    VANTILBORG, HCA
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (04) : 465 - 468
12345