New upper bound for binary codes with minimum distance four

被引：0
|
作者：
Kim, JK [1 ]
Hahn, SG [1 ]
机构：
[1] Korea Adv Inst Sci & Technol, Dept Math, Taejon 305701, South Korea
来源：
DISCRETE MATHEMATICS | 1998年 / 187卷 / 1-3期
关键词：
one-error-correcting codes; binary codes;
D O I：
10.1016/S0012-365X(97)00199-4
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewords in a binary code of length n with minimum distance d between codewords. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：291 / 295
页数：5
相关论文
共 50 条
  • [31] An Upper Bound on the Minimum Distance of Array Low-Density Parity-Check Codes
    Rosnes, Eirik
    Ambroze, Marcel Adrian
    Tomlinson, Martin
    [J]. 2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 3155 - 3159
  • [32] An improved upper bound on the minimum distance of doubly-even self-dual codes
    Krasikov, I
    Litsyn, S
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (01) : 274 - 278
  • [33] On binary locally repairable codes with distance four
    Li, Ruihu
    Yang, Sen
    Rao, Yi
    Fu, Qiang
    [J]. FINITE FIELDS AND THEIR APPLICATIONS, 2021, 72
  • [34] Improving the minimum distance bound of Trace Goppa codes
    Byrne, Isabel
    Dodson, Natalie
    Lynch, Ryan
    Pabon-Cancel, Eric
    Pinero-Gonzalez, Fernando
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2023, 91 (08) : 2649 - 2663
  • [35] A BOUND ON THE MINIMUM DISTANCE OF QUASI-CYCLIC CODES
    Guneri, Cem
    Ozbudak, Ferruh
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (04) : 1781 - 1796
  • [36] A Lower Bound on Minimum Distance of Convolutional Polar Codes
    Morozov, Ruslan
    Trifonov, Peter
    [J]. 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 2104 - 2108
  • [37] Improving the minimum distance bound of Trace Goppa codes
    Isabel Byrne
    Natalie Dodson
    Ryan Lynch
    Eric Pabón–Cancel
    Fernando Piñero-González
    [J]. Designs, Codes and Cryptography, 2023, 91 : 2649 - 2663
  • [38] A LOWER BOUND ON THE MINIMUM EUCLIDEAN DISTANCE OF TRELLIS CODES
    ROUANNE, M
    COSTELLO, DJ
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 311 : 130 - 140
  • [39] The minimum distance of new generalisations of the punctured binary Reed-Muller codes
    Hu, Liqin
    Feng, Keqin
    [J]. CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2020, 12 (04): : 795 - 808
  • [40] The minimum distance of new generalisations of the punctured binary Reed-Muller codes
    Liqin Hu
    Keqin Feng
    [J]. Cryptography and Communications, 2020, 12 : 795 - 808
12345