The edge-diametric theorem in Hamming spaces

Authors:
Christian Bey
Affiliations:
Otto-von-Guericke-Universität Magdeburg, Institut für Algebra und Geometrie, Postfach 4120, 39016 Magdeburg, Germany
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 3
Cited 0

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
A diametric theorem for edges

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.08

Visualization

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].