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):
Displaying 16 items.
- Asymptotic bounds on the equilateral dimension of hypercubes (Q497358) (← links)
- On the minimum average distance of binary constant weight codes (Q932637) (← links)
- On distance sets of large sets of integer points (Q940746) (← links)
- Lower bounds on the minimum average distance of binary codes (Q998361) (← links)
- On the average Hamming distance for binary codes (Q1281403) (← links)
- The asymptotic behaviour of diameters in the average (Q1333337) (← links)
- Models of multi-user write-efficient memories and general diametric theorems (Q1363782) (← links)
- On embedding complete graphs into hypercubes (Q1584282) (← links)
- Minimum average distance subsets in the Hamming cube (Q1598851) (← links)
- On the variance of average distance of subsets in the Hamming space (Q1765526) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- On subsets of the hypercube with prescribed Hamming distances (Q2299612) (← links)
- AVERAGE DISTANCE AND MINIMUM AVERAGE DISTANCE OF BINARY CONSTANT WEIGHT CODE AND ITS PROPERTIES (Q3063606) (← links)
- On average and typical values of sums of pairwise distances for subsets of vertices of the <I>n</I>-dimensional unit cube (Q3409847) (← 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)
