Abstract
We propose a method based on cluster expansion to study the optimal code with a given distance between codewords. Using this approach we find the Gilbert–Varshamov lower bound for the rate of largest code.
Similar content being viewed by others
REFERENCES
D. Brydges, A Short Course on Cluster Expansion, Les Houches 1984, K. Osterwalder and R. Stora, eds. (North Holland Press, 1986).
E. N. Gilbert, A comparison of signalling alphabets, Bell Syst. Tech. Jnl. 31:504-522 (1952).
J. L. Lebowitz and J. K. Percus, Integral equations and inequalities in the theory of fluids, J. Math. Phys. 4:1495-1506 (1963).
F. J. Macwilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes (North-Holland Math Library, Vol. 16, 1977).
A. Procacci, B. N. B. de Lima, and B. Scoppola, A remark on high temperature polymer expansion for lattice systems with infinite range pair interactions, Lett. Math. Phys. 45:303-322 (1998).
D. Ruelle, Statistical Mechanics, Rigorous Results (W. Benjamin inc., 1969).
R. R. Varshamov, Estimate of the number of signals in error correcting codes, Dokl. Akad. Nauk SSSR 117:739-741 (1957).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Procacci, A., Scoppola, B. Statistical Mechanics Approach to Coding Theory. Journal of Statistical Physics 96, 907–912 (1999). https://doi.org/10.1023/A:1004666811087
Issue Date:
DOI: https://doi.org/10.1023/A:1004666811087