ON THE MAXIMAL CARDINALITY OF BINARY TWO-WEIGHT CODES

被引：0
|
作者：
Landjev, Ivan [1 ]
Rousseva, Assia [2 ]
机构：
[1] Bulgarian Acad Sci, Inst Math & Informat, Akad G Bonchev St,Bl 8, Sofia 1113, Bulgaria
[2] Sofia Univ St Kliment Ohridski, Fac Math & Informat, 5 J Bourchier Blvd, Sofia 1164, Bulgaria
来源：
COMPTES RENDUS DE L ACADEMIE BULGARE DES SCIENCES | 2021年 / 74卷 / 10期
关键词：
two-weight codes; the Erdos-Ko-Rado theorem; non-linear codes; main problem of coding theory;
D O I：
10.7546/CRABS.2021.10.01
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
In this note we prove a general upper bound on the size of a binary (n; {d(1); d(2)})-code with d(2) > 2d(1). This bound is used to settle recent conjectures on the maximal cardinality of an (n, {2, d})-code. The special case of d = 4 is also resolved using a classical shifting technique introduced by Erdos, Ko and Rado.
引用
收藏
页码：1423 / 1430
页数：8
相关论文
共 50 条
12345