On the size of maximal binary codes with 2, 3, and 4 distances

10/14/2022
by   Alexander Barg, et al.
0

We address the maximum size of binary codes and binary constant weight codes with few distances. Previous works established a number of bounds for these quantities as well as the exact values for a range of small code lengths. As our main results, we determine the exact size of maximal binary codes with two distances for all lengths n≥ 6 as well as the exact size of maximal binary constant weight codes with 2,3, and 4 distances for several values of the weight and for all but small lengths.

READ FULL TEXT
research
12/14/2018

The lengths of projective triply-even binary codes

It is shown that there does not exist a binary projective triply-even co...
research
03/01/2020

Optimal Constant-Weight Codes under l_1-Metric

Motivated by the duplication-correcting problem for data storage in live...
research
03/22/2021

A Link between Coding Theory and Cross-Validation with Applications

We study the combinatorics of cross-validation based AUC estimation unde...
research
05/08/2023

Binary convolutional codes with optimal column distances

There exists a large literature of construction of convolutional codes w...
research
06/20/2023

New Binary Self-Dual Cyclic Codes with Square-Root-Like Minimum Distances

The construction of self-dual codes over small fields such that their mi...
research
07/24/2023

In search of maximum non-overlapping codes

Non-overlapping codes are block codes that have arisen in diverse contex...
research
06/16/2018

Finding Short Synchronizing Words for Prefix Codes

We study the problems of finding a shortest synchronizing word and its l...

Please sign up or login with your details

Forgot password? Click here to reset