On the average Hamming distance for binary codes

DOI10.1016/S0166-218X(98)00081-XzbMath0968.94021OpenAlexW1994717787MaRDI QIDQ1281403

Shutaong Xia, Fang-Wei Fu

Publication date: 19 September 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(98)00081-x

zbMATH Keywords

varianceMacWilliams-Delsarte identityaverage Hamming distancelower and upper boundsbinary codeAlthöfer-Sillke inequalitydistance enumerator

Mathematics Subject Classification ID

Bounds on codes (94B65)

Related Items (4)

On the minimum average distance of binary constant weight codes ⋮ On the variance of average distance of subsets in the Hamming space ⋮ On the minimum average distance of binary codes: Linear programming approach ⋮ Lower bounds on the minimum average distance of binary codes

Cites Work

• Unnamed Item
• An ``average distance inequality for large subsets of the cube
• Contributions to the geometry of Hamming spaces
• The asymptotic behaviour of diameters in the average
• On the expectation and variance of Hamming distance between two i. i. d. random vectors
• Bounds for binary codes of length less than 25

This page was built for publication: On the average Hamming distance for binary codes