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 条

[1] Bounds on sets with few distances
Barg, Alexander
Musin, Oleg R.
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2011, 118 (04) : 1465 - 1474
[2] BOUNDS ON DISTANCES AND ERROR EXPONENTS OF UNIT MEMORY CODES
THOMMESEN, C
JUSTESEN, J
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (05) : 637 - 649
[3] UPPER-BOUNDS FOR THE CARDINALITY OF S-DISTANCES CODES
LAURENT, M
[J]. EUROPEAN JOURNAL OF COMBINATORICS, 1986, 7 (01) : 27 - 41
[4] BOUNDS FOR BINARY CODES RELATIVE TO PSEUDO-DISTANCES OF k POINTS
Bachoc, Christine
Zemor, Gilles
[J]. ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2010, 4 (04) : 547 - 565
[5] Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances
Boyvalenkov, Peter G.
Dragnev, Peter D.
Hardin, Douglas P.
Saff, Edward B.
Stoyanova, Maya M.
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (06) : 3569 - 3584
[6] Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances
Boyvalenkov, Peter
Dragnev, Peter
Hardin, Douglas
Saff, Edward
Stoyanova, Maya
[J]. 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1747 - 1751
[7] Hamming distances of constacyclic codes of length 3ps and optimal codes with respect to the Griesmer and Singleton bounds
Dinh, Hai Q.
Wang, Xiaoqiang
Liu, Hongwei
Yamaka, Woraphon
[J]. FINITE FIELDS AND THEIR APPLICATIONS, 2021, 70
[8] LATTICES WITH FEW DISTANCES
CONWAY, JH
SLOANE, NJA
[J]. JOURNAL OF NUMBER THEORY, 1991, 39 (01) : 75 - 90
[9] CODES WITH GIVEN DISTANCES
ENOMOTO, H
FRANKL, P
ITO, N
NOMURA, K
[J]. GRAPHS AND COMBINATORICS, 1987, 3 (01) : 25 - 38
[10] Codes with forbidden distances
Bassalygo, L
Cohen, G
Zémor, G
[J]. DISCRETE MATHEMATICS, 2000, 213 (1-3) : 3 - 11

← 1 2 3 4 5 →