On the variance of average distance of subsets in the Hamming space
From MaRDI portal
Publication:1765526
DOI10.1016/J.DAM.2004.08.004zbMath1066.94023OpenAlexW2108589725MaRDI QIDQ1765526
San Ling, Fang-Wei Fu, Xing, Chaoping
Publication date: 23 February 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2004.08.004
Cites Work
- An ``average distance inequality for large subsets of the cube
- Coding for write-efficient memory
- Contributions to the geometry of Hamming spaces
- On the average Hamming distance for binary codes
- The asymptotic behaviour of diameters in the average
- On the Delsarte inequalities
- On the expectation and variance of Hamming distance between two i. i. d. random vectors
- Minimum average distance subsets in the Hamming cube
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the variance of average distance of subsets in the Hamming space
