Geometric representations of binary codes and computation of weight enumerators

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)

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^{'}

.

Recommendations

Cites work

Cited in

(3)

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)