Lower bounds on the minimum average distance of binary codes

DOI10.1016/J.DISC.2007.11.050MaRDI QIDQ998361zbMATH OpenOpenAlexFDO

Authors Beniamin Mounits

Publication date 28 January 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0706.3295

zbMATH Keywords

linear programmingHamming distancebinary codeaverage distance

Mathematics Subject Classification ID

Linear programming (90C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Theory of error-correcting codes and error-detecting codes (94B99)

Abstract: New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.

Recommendations

• On the minimum average distance of binary codes: Linear programming approach
• Minimum average distance subsets in the Hamming cube
• On the minimum average distance of binary constant weight codes
• 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

Cites work

• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• An ``average distance inequality for large subsets of the cube
• Bounds for binary codes of length less than 25
• Contributions to the geometry of Hamming spaces
• Minimum average distance subsets in the Hamming cube
• On shortest cocycle covers of graphs
• On the average Hamming distance for binary codes
• On the minimum average distance of binary codes: Linear programming approach
• Survey of binary Krawtchouk polynomials
• The asymptotic behaviour of diameters in the average

Cited in

(8)

• Average distance and minimum average distance of binary constant weight code and its properties
• Sets of binary sequences with small total Hamming distances
• Minimum average distance subsets in the Hamming cube
• Lower bounds on the minimum distance of long codes in the Lee metric
• On the minimum average distance of binary codes: Linear programming approach
• 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 Minimum Average Code for Finite Memoryless Monotone Sources

This page was built for publication: Lower bounds on the minimum average distance of binary codes

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