The edge-diametric theorem in Hamming spaces

Christian Bey*

*Corresponding author for this work

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 languageEnglish
JournalDiscrete Applied Mathematics
Volume156
Issue number9
Pages (from-to)1510-1517
Number of pages8
ISSN0166-218X
DOIs
Publication statusPublished - 01.05.2008

Fingerprint

Dive into the research topics of 'The edge-diametric theorem in Hamming spaces'. Together they form a unique fingerprint.

Cite this