On a class of abstract polytopes constructed from binary codes (Q2639031)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4183332
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a class of abstract polytopes constructed from binary codes |
scientific article; zbMATH DE number 4183332 |
Statements
On a class of abstract polytopes constructed from binary codes (English)
0 references
1990
0 references
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.
0 references
quotient construction for abstract polytopes
0 references
combinatorial cube
0 references
binary code
0 references
automorphism group
0 references
minimum weight
0 references
quadratic residue codes
0 references
0.7568613886833191
0 references
0.7535832524299622
0 references
0.7475744485855103
0 references
0.7475744485855103
0 references
