Two-weight Codes The Erdős‒Ko‒Rado Theorem Non-linear Codes Main Problem of Coding Theory
Issue Date:
2-Dec-2021
Publisher:
"Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences
Citation:
Landjev I., Rousseva, A. On the Maximal Cardinality of Binary Two-weight Codes. Comptes Rendus de l'Acadamie Bulgare des Sciences, 74, 10, "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, 2021, DOI:10.7546/CRABS.2021.10.01, 1423-1430
Series/Report no.:
Comptes Rendus de l'Acadamie Bulgare des Sciences;74(10)
Abstract:
In this note we prove a general upper bound on the size of a binary (n,{d1,d2})‒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 Erdős,Ko and Rado.
