Eigenvalue proof of Hegedüs bound: constant-distance subset families of {1..n} have size ≤ n when λ ≠ (n+1)/2, extending to size ≤ n(q-1) over alphabet size q.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
An expository paper that unifies prior results on equidistant binary codes and identifies a missed subcase in published characterizations for n ≡ 2 mod 4.
citing papers explorer
-
An eigenvalue proof of Heged\"{u}s's bound for codes with a single Hamming distance
Eigenvalue proof of Hegedüs bound: constant-distance subset families of {1..n} have size ≤ n when λ ≠ (n+1)/2, extending to size ≤ n(q-1) over alphabet size q.
-
An Explication of Optimal Equidistant Codes
An expository paper that unifies prior results on equidistant binary codes and identifies a missed subcase in published characterizations for n ≡ 2 mod 4.