Geometric representations of binary codes and computation of weight enumerators

DOI10.1016/j.aam.2009.12.001zbMath1213.05189arXiv0805.1742OpenAlexW2145958318MaRDI QIDQ984029

Pavel Rytíř

Publication date: 13 July 2010

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

weight enumeratorbinary codegeometric representationstriangle matchingtriangular configuration

Mathematics Subject Classification ID

Hypergraphs (05C65) Linear codes (general theory) (94B05) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Simplicial sets and complexes in algebraic topology (55U10)

Related Items (3)

Binary linear codes, dimers and hypermatrices ⋮ Binary linear codes via 4D discrete Ihara-Selberg function ⋮ Geometric representations of linear codes

Cites Work

• On the theory of Pfaffian orientations. I: Perfect matchings and permanents
• Dimers on surface graphs and spin structures. I
• Optimization via enumeration: A new algorithm for the max cut problem

This page was built for publication: Geometric representations of binary codes and computation of weight enumerators