Binary linear codes via 4D discrete Ihara-Selberg function

DOI10.4171/AIHPD/65MaRDI QIDQ1733566zbMATH OpenOpenAlexFDO

Authors Martin Loebl

Publication date 21 March 2019

Published in Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) (Search for Journal in Brave)

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

zbMATH Keywords

Bass' theorembinary linear codediscrete Ihara-Selberg functiongraph polynomialhyper-determinanthyper-matrixIsing partition functionweight enumerator

Mathematics Subject Classification ID

Graph polynomials (05C31) Convolutional codes (94B10)

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 1960's for the special case of the Ising partition function of 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 cubic 3D lattices.

Review text

Summary: 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 1960's 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.

Recommendations

• Optimal binary linear codes and Z/sub 4/-linearity
• Weight hierarchies of binary linear codes of dimension 4
• On optimal linear codes of dimension 4
• Binary convolutional codes and linear blocks codes over F₄
• On the construction of optimal linear codes of dimension four
• Linear codes over F₄+uF₄
• NEW OPTIMAL LINEAR CODES OVER
• Improved binary codes and sequence families from Z/sub 4/-linear codes
• Z2Z4-Linear Codes
• Linear codes over \(\frac{\mathbb{Z}_4[x]}{\langle{x^2} + 2x \rangle}\)

Cites work

• A Combinatorial Proof of Bass’s Evaluations of the Ihara-Selberg Zeta Function for Graphs
• A Combinatorial Solution of the Two-Dimensional Ising Model
• Bass' identity and a coin arrangements lemma
• Binary linear codes, dimers and hypermatrices
• Combinatorial Aspects of the Ising Model for Ferromagnetism. I. A Conjecture of Feynman on Paths and Graphs
• Discrete mathematics in statistical physics. Introductory lectures
• Geometric representations of binary codes and computation of weight enumerators
• Geometric representations of linear codes
• scientific article; zbMATH DE number 2151256 (Why is no real title available?)
• scientific article; zbMATH DE number 3326387 (Why is no real title available?)
• scientific article; zbMATH DE number 3041992 (Why is no real title available?)
• Permanents, Pfaffian orientations, and even directed circuits
• THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE

Cited in

(1)

• Binary linear codes, dimers and hypermatrices

This page was built for publication: Binary linear codes via 4D discrete Ihara-Selberg function

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