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/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

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

Zendy Tools

Zendy Open

As far as we know, there is no decoding algorithm of any binary self-dual$[40, 20, 8]$ code except for the syndrome decoding applied to the codedirectly. This syndrome decoding for a binary self-dual $[40,20,8]$ code is notefficient in the sense that it cannot be done by hand due to a large syndrometable. The purpose of this paper is to give two new efficient decodingalgorithms for an extremal binary doubly-even self-dual $[40,20, 8]$ code$C_{40,1}^{DE}$ by hand with the help of a Hermitian self-dual $[10,5,4]$ code$E_{10}$ over $GF(4)$. The main idea of this decoding is to project codewordsof $C_{40,1}^{DE}$ onto $E_{10}$ so that it reduces the complexity of thedecoding of $C_{40,1}^{DE}$. The first algorithm is called the representationdecoding algorithm. It is based on the pattern of codewords of $E_{10}$. Usingcertain automorphisms of $E_{10}$, we show that only eight types of codewordsof $E_{10}$ can produce all the codewords of $E_{10}$. The second algorithm iscalled the syndrome decoding algorithm based on $E_{10}$. It first solves thesyndrome equation in $E_{10}$ and finds a corresponding binary codeword of$C_{40,1}^{DE}$.

A Projection Decoding of a Binary Extremal Self-Dual Code of Length $40$