Self-dual binary codes from small covers and simple polytopes
In [Homology Homotopy Appl. 10, No. 2, 139--148 (2008; Zbl 1160.57013)], \textit{M. Kreck} and \textit{V. Puppe} studied connections between involutions of closed manifolds and self-dual binary codes. They proved that every involution with only isolated fixed points on a compact \(3\)-manifold determines a self-dual binary code. Moreover, they showed that every self-dual binary code can be obtained from an involution on an orientable \(3\)-manifold with the maximal number of isolated fixed points. A small cover, introduced in [\textit{M. Davis} and \textit{T. Januszkiewicz}, Duke Math. J. 62, No. 2, 417--451 (1991; Zbl 0733.52006)], is a closed smooth manifold \(M^n\) admitting a locally standard action of \({\mathbb{Z}}_2^n\), whose orbit space is an \(n\)-dimensional simple convex polytope. In the paper under review, the authors find connections between the work of Kreck and Puppe and the work of Davis and Januszkiewicz. They show that a small cover over a simple \(n\)-polytope produces a self-dual code if and only if the \(n\)-polytope is \(n\)-colorable and \(n\) is odd. They then describe such a self-dual binary code in terms of the combinatorics of the \(n\)-polytope. They also construct a family of binary codes from an arbitrary simple \(n\)-polytope and give necessary and sufficient conditions for the binary codes to be self-dual. Furthermore, they obtain new criteria to decide whether a simple \(n\)-polytope is \(n\)-colorable in terms of the associated family of binary codes.
- Involutions on 3-manifolds and self-dual, binary codes
- The orientability of small covers and coloring simple polytopes
- The second Stiefel-Whitney class of small covers
- Group actions and codes
- Small covers over prisms
- Topological types of 3-dimensional small covers
- Haken 3-manifolds in small covers
- Orientable small covers over the product of 2-cube with n-gon
- Combinatorial constructions of three-dimensional small covers
- Small covers over products of a polygon with a simplex
- A simple way to tell a simple polytope from its graph
- A theorem on cyclic polytopes
- An upper bound for self-dual codes
- Construction of universal bundles. II
- Convex Polytopes
- Convex polytopes, Coxeter orbifolds and torus actions
- Equivariant cohomology and analytic descriptions of ring isomorphisms
- Equivariant cohomology, Koszul duality, and the localization theorem
- Equivariant cohomology, syzygies and orbit structure
- Group actions and codes
- Involutions on 3-manifolds and self-dual, binary codes
- Is there a (72,36) d = 16 self-dual code? (Corresp.)
- On the graph structure of convex polyhedra in n-space
- On the nonexistence of extremal self-dual codes
- Projectivities in simplicial complexes and colorings of simple polytopes
- The extended quadratic residue code is the only (48,24,12) self-dual doubly-even code
This page was built for publication: Self-dual binary codes from small covers and simple polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1673635)