arXiv Analytics

Sign in

arXiv:2409.07877 [math.CO]AbstractReferencesReviewsResources

A new upper bound for codes with a single Hamming distance

Gábor Hegedüs

Published 2024-09-12Version 1

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.

Comments: comments are welcome
Categories: math.CO, math.MG
Subjects: 05D05, 12D99, 15A03
Related articles: Most relevant | Search more
arXiv:1407.8537 [math.CO] (Published 2014-07-31)
A new application of the $\otimes_h$-product to $α$-labelings
arXiv:1210.6455 [math.CO] (Published 2012-10-24)
An application of a bijection of Mansour, Deng, and Du
arXiv:1509.04862 [math.CO] (Published 2015-09-16)
An application of the Local C(G,T) Theorem to a conjecture of Weiss

Links

Toolbox