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].
Original language | English |
---|---|
Journal | Discrete Applied Mathematics |
Volume | 156 |
Issue number | 9 |
Pages (from-to) | 1510-1517 |
Number of pages | 8 |
ISSN | 0166-218X |
DOIs | |
Publication status | Published - 01.05.2008 |