A projection decoding of a binary extremal self-dual code of length 40
From MaRDI portal
Publication:521861
DOI10.1007/s10623-016-0253-0zbMath1359.94709arXiv1701.04180OpenAlexW2488713552MaRDI QIDQ521861
Publication date: 12 April 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.04180
Cites Work
- Unnamed Item
- Unnamed Item
- A complete classification of doubly even self-dual codes of length 40
- Selected unsolved problems in coding theory.
- Singly-even self-dual codes of length 40
- On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
- Self-dual codes over GF(4)
- Self-dual codes over the Kleinian four group
- Decoding binary \(R\)(2,5) by hand
- Some extremal self-dual codes and unimodular lattices in dimension 40
- A classification of self-orthogonal codes over GF(2)
- A new upper bound on the minimal distance of self-dual codes
- Some restrictions on weight enumerators of singly even self-dual codes
- Decoding the Golay codes
- Fundamentals of Error-Correcting Codes
- Projections of Binary Linear Codes onto Larger Fields
- Quantum error correction via codes over GF(4)
- Classification of Extremal and $s$-Extremal Binary Self-Dual Codes of Length 38
- On the classification and enumeration of self-dual codes
- On extremal additive \({\mathbb{F}}_4\) codes of length 10 to 18
This page was built for publication: A projection decoding of a binary extremal self-dual code of length 40
