New lower bounds for the number of ACG codes over F₄
From MaRDI portal
Publication:5128540
Recommendations
- scientific article; zbMATH DE number 6123989
- Self-dual additive \(\mathbb{F}_4\)-codes of lengths up to 40 represented by circulant graphs
- New lower bounds for constant weight codes
- New self-dual additive \(\mathbb{F}_4\)-codes constructed from circulant graphs
- Directed graph representation of half-rate additive codes over \(\text{GF}(4)\)
Cites work
- Circulant Based Extremal Additive Self-Dual Codes Over>tex<$hboxGF,(4)$>/tex<
- Designs in additive codes over GF(4)
- Efficient computing of some vector operations over \(\mathrm{GF}(3)\) and \(\mathrm{GF}(4)\)
- Graph-based classification of self-dual additive codes over finite fields
- scientific article; zbMATH DE number 1243360 (Why is no real title available?)
- New self-dual additive \(\mathbb{F}_4\)-codes constructed from circulant graphs
- On additive GF(4) codes
- On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
- Quantum error correction via codes over GF(4)
- Searching for (near) optimal codes
- Self-dual codes over the Kleinian four group
- Some new results for additive self-dual codes over \(\mathrm{GF}(4)\)
- Stabilizer codes can be realized as graph codes
- What is Q-extension
This page was built for publication: New lower bounds for the number of ACG codes over \(\mathbb{F}_4\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5128540)
