Pages that link to "Item:Q757399"
From MaRDI portal
The following pages link to An ``average distance'' inequality for large subsets of the cube (Q757399):
Displayed 10 items.
- On the minimum average distance of binary constant weight codes (Q932637) (← links)
- Lower bounds on the minimum average distance of binary codes (Q998361) (← links)
- On the average Hamming distance for binary codes (Q1281403) (← links)
- Models of multi-user write-efficient memories and general diametric theorems (Q1363782) (← links)
- On embedding complete graphs into hypercubes (Q1584282) (← links)
- On the variance of average distance of subsets in the Hamming space (Q1765526) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- AVERAGE DISTANCE AND MINIMUM AVERAGE DISTANCE OF BINARY CONSTANT WEIGHT CODE AND ITS PROPERTIES (Q3063606) (← links)
- A relation between the average Hamming distance and the average Hamming weight of binary codes (Q5934191) (← links)
- On the minimum average distance of binary codes: Linear programming approach (Q5939230) (← links)