Directed graph representation of half-rate additive codes over \(\text{GF}(4)\)
From MaRDI portal
Publication:2430707
DOI10.1007/s10623-010-9469-6zbMath1213.94171arXiv0902.3883OpenAlexW2057277076MaRDI QIDQ2430707
Matthew G. Parker, Lars Eirik Danielsen
Publication date: 8 April 2011
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0902.3883
Related Items
Searching for (near) Optimal Codes ⋮ Additive Toeplitz codes over \(\mathbb{F}_4\) ⋮ Self-dual additive \(\mathbb{F}_4\)-codes of lengths up to 40 represented by circulant graphs ⋮ Classification of real Bott manifolds and acyclic digraphs ⋮ The nonexistence of an additive quaternary \([15, 5, 9\)-code] ⋮ k-autocorrelation and its applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
- Formally self-dual additive codes over \(\mathbb F_4\)
- The nonexistence of near-extremal formally self-dual codes
- Graphic presentations of isotropic systems
- Small additive quaternary codes.
- Classifying subspaces of Hamming spaces
- Graph-based classification of self-dual additive codes over finite fields
- Broué-Enguehard maps and Atkin-Lehner involutions
- Circulant Based Extremal Additive Self-Dual Codes Over>tex<$hboxGF,(4)$>/tex<
- Projections of Binary Linear Codes onto Larger Fields
- Optimal quaternary linear rate-1/2 codes of length ≤ 18
- Quantum error correction via codes over GF(4)
- Short Additive Quaternary Codes