On a class of abstract polytopes constructed from binary codes

From MaRDI portal





The author gives a quotient construction for abstract polytopes, where the quotients are constructed with respect to subgroups of the automorphism group of a given abstract polytope. This is applied to the situation where the polytope is a generalized combinatorial cube with vertex set \(\{0,1\}^ v\); then any binary code of length v can be considered as an automorphism group of the polytope, and the construction applies provided that the minimum weight of the code is sufficiently large. The author discusses several examples, among them quadratic residue codes.











This page was built for publication: On a class of abstract polytopes constructed from binary codes

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