Minimum average distance subsets in the Hamming cube (Q1598851)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimum average distance subsets in the Hamming cube |
scientific article; zbMATH DE number 1746284
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum average distance subsets in the Hamming cube |
scientific article; zbMATH DE number 1746284 |
Statements
Minimum average distance subsets in the Hamming cube (English)
0 references
28 May 2002
0 references
In 1979 Ahlswede and Katona proposed the following discrete isoperimetric problem: find a vertex set of fixed size in the hypercube with minimum average distance. This survey-type paper reports a number of recent results. Furthermore it conjectures a general way to describe the possible candidates to be extremal, showing that the known cases belong to this class.
0 references
discrete isoperimetric problem
0 references
unit hypercube
0 references
Hamming space
0 references
