A new upper bound for codes with a single Hamming distance
Combinatorics
2024-09-28 v1 Metric Geometry
Abstract
In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.
Cite
@article{arxiv.2409.07877,
title = {A new upper bound for codes with a single Hamming distance},
author = {Gábor Hegedüs},
journal= {arXiv preprint arXiv:2409.07877},
year = {2024}
}
Comments
comments are welcome