JournalsaihpdVol. 6, No. 1pp. 73–95

Binary linear codes via 4D discrete Ihara–Selberg function

  • Martin Loebl

    Charles University, Prague, Czechia
Binary linear codes via 4D discrete Ihara–Selberg function cover
Download PDF

A subscription is required to access this article.

Abstract

We express the weight enumerator of each binary linear code, in particular the Ising partition function of an arbitrary finite graph, as a formal infinite product. An analogous result was obtained by Feynman and Sherman in the beginning of the 1960s for the special case of the Ising partition function of the planar graphs. A product expression is an important step towards understanding the logarithm of the Ising partition function, for general graphs and in particular for the cubic 3D lattices.

Cite this article

Martin Loebl, Binary linear codes via 4D discrete Ihara–Selberg function. Ann. Inst. Henri Poincaré Comb. Phys. Interact. 6 (2019), no. 1, pp. 73–95

DOI 10.4171/AIHPD/65