The complete intersection theorem for systems of finite sets
European Journal of Combinatorics
Regular Article: The Diametric Theorem in Hamming Spaces驴Optimal Anticodes
Advances in Applied Mathematics
On Perfect Codes and Related Concepts
Designs, Codes and Cryptography
Hi-index | 0.00 |
Let ${\cal H}(n)=\{0,1\}^n$ denote the binary Hamming space with the Hamming distance dH. The Hamming weight is denoted by wtH. Given integers $l\geq 1,\ 1\leq\delta A|=l + 1 there exist two distinct points a,b ∈A with dH (a,b) ≤δ.