English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We explore the connection between simple polytopes and self-dual binary codesvia the theory of small covers. We first show that a small cover $M^n$ over asimple $n$-polytope $P^n$ produces a self-dual code in the sense of Kreck-Puppeif and only if $P^n$ is $n$-colorable and $n$ is odd. Then we show how todescribe such a self-dual binary code in terms of the combinatorial informationof $P^n$. Moreover, we can define a family of binary codes$\mathfrak{B}_k(P^n)$, $0\leq k\leq n$, from an arbitrary simple $n$-polytope$P^n$. We will give some necessary and sufficient conditions for$\mathfrak{B}_k(P^n)$ to be a self-dual code. A spinoff of our study of suchbinary codes gives some new ways to judge whether a simple $n$-polytope $P^n$is $n$-colorable in terms of the associated binary codes $\mathfrak{B}_k(P^n)$.In addition, we prove that the minimum distance of the self-dual binary codeobtained from a $3$-colorable simple $3$-polytope is always $4$.

Self-dual binary codes from small covers and simple polytopes