by Bey, Ch.
Preprint series: 04-31, Preprints
- 05D05 Extremal set theory
- 06A07 Combinatorics of partially ordered sets
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.
Keywords: Hamming Space, Diametric Problem, Intersection Theorem
The author(s) agree, that this abstract may be stored asfull text and distributed as such by abstracting services.