Geometric representations of binary codes and computation of weight enumerators

DOI10.1016/J.AAM.2009.12.001zbMATH Open1213.05189arXiv0805.1742OpenAlexW2145958318MaRDI QIDQ984029FDOQ984029

Publication date: 13 July 2010

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

Abstract: For every linear binary code

C

, we construct a geometric triangular configuration

D e l t a

so that the weight enumerator of

C

is obtained by a simple formula from the weight enumerator of the cycle space of

D e l t a

. The triangular configuration

D e l t a

thus provides a geometric representation of

C

which carries its weight enumerator. This is the initial step in the suggestion by M. Loebl, to extend the theory of Pfaffian orientations from graphs to general linear binary codes. Then we carry out also the second step by constructing, for every triangular configuration

D e l t a

, a triangular configuration

D e l t a^{'}

and a bijection between the cycle space of

D e l t a

and the set of the perfect matchings of

D e l t a^{'}

.

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

zbMATH Keywords

weight enumerator binary code geometric representations triangle matching triangular configuration

Mathematics Subject Classification ID

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

Cites Work

Cited In (3)

   Recommendations

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

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