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

DOI10.1016/S0166-218X(00)00284-5MaRDI QIDQ5939230zbMATH OpenOpenAlexFDO

Authors Fangwei Fu, Victor K. Wei, Raymond W. Yeung

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

average Hamming distancebinary codeslinear programming

Mathematics Subject Classification ID

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

Recommendations

• Lower bounds on the minimum average distance of binary codes
• On the average Hamming distance for binary codes
• On the minimum average distance of binary constant weight codes
• Further results on the asymptotic behaviour of minimum average Hamming distance for binary codes
• The linear programming bound for binary linear codes

Cites work

• An ``average distance inequality for large subsets of the cube
• Bounds for binary codes of length less than 25
• Coding for write-efficient memory
• Contributions to the geometry of Hamming spaces
• scientific article; zbMATH DE number 4074964 (Why is no real title available?)
• scientific article; zbMATH DE number 3543912 (Why is no real title available?)
• scientific article; zbMATH DE number 1286502 (Why is no real title available?)
• On the average Hamming distance for binary codes
• On the expectation and variance of Hamming distance between two i. i. d. random vectors
• On the Hamming distance between two i.i.d. random n-tuples over a finite set
• The asymptotic behaviour of diameters in the average

Cited in

(12)

• Sets of binary sequences with small total Hamming distances
• On the variance of average distance of subsets in the Hamming space
• Further results on the asymptotic behaviour of minimum average Hamming distance for binary codes
• Average distance and minimum average distance of binary constant weight code and its properties
• Minimum distance computation of linear codes via genetic algorithms with permutation encoding
• Optimal Binary Coding of Ordered Numbers
• Common Information, Noise Stability, and Their Extensions
• STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES
• On the \(\Phi \)-stability and related conjectures
• Minimum possible block length of a linear binary code for some distances
• On the minimum average distance of binary constant weight codes
• Lower bounds on the minimum average distance of binary codes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5939230)