Minimum average distance subsets in the Hamming cube (Q1598851): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(01)00242-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2014814022 / rank | |||
Normal rank | |||
Latest revision as of 11:22, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum average distance subsets in the Hamming cube |
scientific article |
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
