On the high density behavior of Hamming codes with fixed minimum distance

DOI10.1007/S10955-006-9142-7MaRDI QIDQ852065zbMATH OpenOpenAlexFDO

Authors Francesco Zamponi, G. Parisi

Publication date 27 November 2006

Published in Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cond-mat/0602661

zbMATH Keywords

coding theoryHamming codesvirial expansionHyperNetted Chain equationsliquid theory

Mathematics Subject Classification ID

Classical equilibrium statistical mechanics (general) (82B05) Phase transitions (general) in equilibrium statistical mechanics (82B26) Linear codes (general theory) (94B05) Statistical mechanics of liquids (82D15)

Abstract: We discuss the high density behavior of a system of hard spheres of diameter d on the hypercubic lattice of dimension n, in the limit n -> oo, d -> oo, d/n=delta. The problem is relevant for coding theory. We find a solution to the equations describing the liquid up to very large values of the density, but we show that this solution gives a negative entropy for the liquid phase when the density is large enough. We then conjecture that a phase transition towards a different phase might take place, and we discuss possible scenarios for this transition. Finally we discuss the relation between our results and known rigorous bounds on the maximal density of the system.

Recommendations

• scientific article; zbMATH DE number 4127151
• Further results on the asymptotic behaviour of minimum average Hamming distance for binary codes
• The minimum Hamming distances of irreducible cyclic codes
• The minimum Hamming distance of cyclic codes of length \(2p^s\)
• scientific article; zbMATH DE number 910957
• On codes with distances \(d\) and \(n\)
• Construction of a class of codes with error-tolerance and its Hamming distance
• Hamiltonicity of minimum distance graphs of 1-perfect codes
• On the Hamming distance of linear codes over a finite chain ring
• Random codes: minimum distances and error exponents

Cites work

• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Numerical results on the asymptotic rate of binary codes
• On the high density behavior of Hamming codes with fixed minimum distance
• On the optimum of Delsarte's linear program
• Statistical mechanics approach to coding theory.

Cited in

(4)

• On the most compact regular lattices in large dimensions: A statistical mechanical approach
• Random sequential coding by Hamming distance
• On the high density behavior of Hamming codes with fixed minimum distance
• scientific article; zbMATH DE number 4127151 (Why is no real title available?)

This page was built for publication: On the high density behavior of Hamming codes with fixed minimum distance

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