Binary linear codes via 4D discrete Ihara-Selberg function

DOI10.4171/AIHPD/65zbMath1407.05132arXiv1503.02525OpenAlexW2963251575MaRDI QIDQ1733566

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

weight enumeratorbinary linear codegraph polynomialIsing partition functionBass' theoremdiscrete Ihara-Selberg functionhyper-determinanthyper-matrix

Mathematics Subject Classification ID

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

Related Items (1)

Binary linear codes, dimers and hypermatrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bass' identity and a coin arrangements lemma
• Geometric representations of binary codes and computation of weight enumerators
• Binary linear codes, dimers and hypermatrices
• Permanents, Pfaffian orientations, and even directed circuits
• Geometric representations of linear codes
• A Combinatorial Proof of Bass’s Evaluations of the Ihara-Selberg Zeta Function for Graphs
• THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
• Combinatorial Aspects of the Ising Model for Ferromagnetism. I. A Conjecture of Feynman on Paths and Graphs
• A Combinatorial Solution of the Two-Dimensional Ising Model

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