An ``average distance inequality for large subsets of the cube

DOI10.1016/0095-8956(92)90024-RzbMath0723.05055MaRDI QIDQ757399

Torsten Sillke, Ingo Althöfer

Publication date: 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

Hamming distanceaverage distance

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items

Application of cut polyhedra. I, Models of multi-user write-efficient memories and general diametric theorems, On the minimum average distance of binary constant weight codes, A relation between the average Hamming distance and the average Hamming weight of binary codes, On the variance of average distance of subsets in the Hamming space, On the minimum average distance of binary codes: Linear programming approach, AVERAGE DISTANCE AND MINIMUM AVERAGE DISTANCE OF BINARY CONSTANT WEIGHT CODE AND ITS PROPERTIES, Lower bounds on the minimum average distance of binary codes, On the average Hamming distance for binary codes, On embedding complete graphs into hypercubes

Cites Work

• Contributions to the geometry of Hamming spaces
• Inequalities: theory of majorization and its applications
• Unnamed Item
• Unnamed Item