| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419883 | Discrete Applied Mathematics | 2008 | 8 Pages |
Abstract
The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined. The binary case was solved earlier by Ahlswede and Khachatrian [A diametric theorem for edges, J. Combin. Theory Ser. A 92(1) (2000) 1–16].
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Christian Bey,