Minimum average distance subsets in the Hamming cube

DOI10.1016/S0012-365X(01)00242-4zbMath0990.05122OpenAlexW2014814022MaRDI QIDQ1598851

André Kündgen

Publication date: 28 May 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00242-4

zbMATH Keywords

Hamming spaceunit hypercubediscrete isoperimetric problem

Mathematics Subject Classification ID

Linear programming (90C05) Extremal set theory (05D05) Distance in graphs (05C12)

Related Items (4)

On the minimum average distance of binary constant weight codes ⋮ On the variance of average distance of subsets in the Hamming space ⋮ AVERAGE DISTANCE AND MINIMUM AVERAGE DISTANCE OF BINARY CONSTANT WEIGHT CODE AND ITS PROPERTIES ⋮ Lower bounds on the minimum average distance of binary codes

This page was built for publication: Minimum average distance subsets in the Hamming cube