On the minimum average distance of binary codes: Linear programming approach

DOI10.1016/S0166-218X(00)00284-5zbMath1018.94038OpenAlexW1976116479MaRDI QIDQ5939230

Fang-Wei Fu, Raymond W. Yeung, Victor K. Wei

Publication date: 26 August 2003

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00284-5

zbMATH Keywords

linear programmingbinary codesaverage Hamming distance

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Linear programming (90C05) Bounds on codes (94B65) Distance in graphs (05C12)

Related Items (7)

STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES ⋮ On the \(\Phi \)-stability and related conjectures ⋮ On the minimum average distance of binary constant weight codes ⋮ On the variance of average distance of subsets in the Hamming space ⋮ AVERAGE DISTANCE AND MINIMUM AVERAGE DISTANCE OF BINARY CONSTANT WEIGHT CODE AND ITS PROPERTIES ⋮ Lower bounds on the minimum average distance of binary codes ⋮ Common Information, Noise Stability, and Their Extensions

Cites Work

• 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
• Bounds for binary codes of length less than 25
• On the Hamming distance between two i.i.d. random n-tuples over a finite set

This page was built for publication: On the minimum average distance of binary codes: Linear programming approach