An ``average distance inequality for large subsets of the cube
From MaRDI portal
Publication:757399
DOI10.1016/0095-8956(92)90024-RzbMath0723.05055MaRDI QIDQ757399
Publication date: 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
05C12: Distance in graphs
Related Items
A relation between the average Hamming distance and the average Hamming weight of binary codes, On the minimum average distance of binary codes: Linear programming approach, On the minimum average distance of binary constant weight codes, Lower bounds on the minimum average distance of binary codes, On the average Hamming distance for binary codes, Models of multi-user write-efficient memories and general diametric theorems, On embedding complete graphs into hypercubes, On the variance of average distance of subsets in the Hamming space, Application of cut polyhedra. I, AVERAGE DISTANCE AND MINIMUM AVERAGE DISTANCE OF BINARY CONSTANT WEIGHT CODE AND ITS PROPERTIES
Cites Work