Bounds on codes with few distances

被引：0
|
作者：
Barg, Alexander [1 ,2 ]
Musin, Oleg R. [3 ]
机构：
[1] Univ Maryland, Inst Syst Res, Dept ECE, College Pk, MD 20742 USA
[2] Russian Acad Sci, Inst Problems Informat Transmiss, Dobrushin Math Lab, Moscow, Russia
[3] Univ Texas Brownsville, Dept Math, Brownsville, TX USA
来源：
2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY | 2010年
关键词：
INTERSECTION-THEOREMS; FINITE SETS; SYSTEMS;
D O I：
10.1109/ISIT.2010.5513692
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We prove a new bound on the size of codes with few distances in the Hamming space, improving an earlier result of P. Delsarte. We also improve the Ray-Chaudhuri-Wilson bound of the size of uniform intersecting families of subsets (constant-weight codes) and the bound of Delsarte-Goethals-Seidel on the maximum size of spherical codes with few distances. Finally, we find the size of maximal binary codes and maximal constant-weight codes of small length with 2,3, and 4 distances.
引用
收藏
页码：1115 / 1119
页数：5
相关论文
共 50 条
  • [31] NEIGHBOR DISTANCES AND SYMMETRY IN GROUP CODES
    SLEPIAN, D
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1971, 17 (05) : 630 - +
  • [32] DUAL DISTANCES OF COMPLETELY REGULAR CODES
    COURTEAU, B
    MONTPETIT, A
    [J]. DISCRETE MATHEMATICS, 1991, 89 (01) : 7 - 15
  • [33] Cyclic distances of idempotent convolutional codes
    Gomez-Torrecillas, Jose
    Lobillo, F. J.
    Navarro, Gabriel
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 2021, 102 : 37 - 62
  • [34] Constructions of binary codes with two distances
    Landjev, Ivan
    Rousseva, Assia
    Vorobev, Konstantin
    [J]. DISCRETE MATHEMATICS, 2023, 346 (06)
  • [35] Generalized column distances for convolutional codes
    Cardell, Sara D.
    Firer, Marcelo
    Napp, Diego
    [J]. 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 21 - 25
  • [36] Additive codes with few weights
    Panario, Daniel
    Sahin, Murat
    Wang, Qiang
    [J]. CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2024, 16 (05): : 1077 - 1102
  • [37] Optimal few-weight codes and their subfield codes
    Wu, Yansheng
    [J]. JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2023,
  • [38] MODIFIED BOUNDS FOR COVERING CODES
    HONKALA, IS
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (02) : 351 - 365
  • [39] Bounds on the rate of superimposed codes
    D'yachkov, A. G.
    Vorobyev, I. V.
    Polyanskii, N. A.
    Shchukin, V. Yu.
    [J]. 2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 2341 - 2345
  • [40] Bounds on the Rate of Separating Codes
    Vorob'ev, I. V.
    [J]. PROBLEMS OF INFORMATION TRANSMISSION, 2017, 53 (01) : 30 - 41
12345