On the minimum average distance of binary constant weight codes
From MaRDI portal
Publication:932637
DOI10.1016/j.disc.2007.07.081zbMath1208.94064OpenAlexW2046877102MaRDI QIDQ932637
Fang-Wei Fu, Yong Jiang, Shutaong Xia
Publication date: 11 July 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.081
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 expectation and variance of Hamming distance between two i. i. d. random vectors
- Minimum average distance subsets in the Hamming cube
- The Probability of Undetected Error for Binary Constant-Weight Codes
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- Association schemes and coding theory
- On the Hamming distance between two i.i.d. random n-tuples over a finite set
- 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
