On the high density behavior of Hamming codes with fixed minimum distance
DOI10.1007/S10955-006-9142-7zbMATH Open1113.82004arXivcond-mat/0602661OpenAlexW2024078744MaRDI QIDQ852065FDOQ852065
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
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
Classical equilibrium statistical mechanics (general) (82B05) Phase transitions (general) in equilibrium statistical mechanics (82B26) Linear codes (general theory) (94B05) Statistical mechanics of liquids (82D15)
Cites Work
- Title not available (Why is that?)
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- On the optimum of Delsarte's linear program
- Statistical mechanics approach to coding theory.
- Numerical results on the asymptotic rate of binary codes
- On the high density behavior of Hamming codes with fixed minimum distance
Cited In (4)
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)