An ``average distance inequality for large subsets of the cube
From MaRDI portal
Publication:757399
DOI10.1016/0095-8956(92)90024-RzbMATH Open0723.05055MaRDI QIDQ757399FDOQ757399
Authors: Ingo Althöfer, Torsten Sillke 
Publication date: 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Recommendations
- On average and typical values of sums of pairwise distances for subsets of vertices of the n-dimensional unit cube
- scientific article; zbMATH DE number 3964986
- The extremal average distance of cubic graphs
- An isoperimetric inequality for antipodal subsets of the discrete cube
- On the average volume of subsets in Euclidean \(d\)-space
- scientific article; zbMATH DE number 1961236
- The average distance property for subsets of Euclidean space
- Minimum average distance subsets in the Hamming cube
- scientific article; zbMATH DE number 4053623
Cites Work
Cited In (13)
- On average and typical values of sums of pairwise distances for subsets of vertices of the n-dimensional unit cube
- Lower bounds on the minimum average distance of binary codes
- On the variance of average distance of subsets in the Hamming space
- Application of cut polyhedra. I
- On embedding complete graphs into hypercubes
- On distance sets of large sets of integer points
- Minimum average distance subsets in the Hamming cube
- Average distance and minimum average distance of binary constant weight code and its properties
- 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
- Models of multi-user write-efficient memories and general diametric theorems
- On the average Hamming distance for binary codes
This page was built for publication: An ``average distance inequality for large subsets of the cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757399)
