Small additive quaternary codes.
Consider the additive group \(Q= \mathbb{Z}_2\times \mathbb{Z}_2\). A code with codewords of length \(n\) over \(Q\) is called additive if it is an additive subgroup of \(Q^n\). A code with codewords of length \(n\) over \(Q\) is called optimal when it has the largest possible size for given values of \(n\) and \(d\). In this article, the authors determine the parameters of the optimal additive codes of word length at most 12 over \(Q\), up to two specific sets of parameters. Some of the codes found improve on the best quaternary codes known. This search for optimal additive codes over \(Q\) is equivalent to the search for how many lines it is possible to take in a binary projective space such that any \(t\) are independent, or equivalently, how many lines it is possible to take in a binary projective space such that no hyperplane contains more than \(m\) of them. Here, lines may be repeated, and a line is sometimes the span of two not necessarily distinct points.
- \(\mathbb Z_2\mathbb Z_4\)-additive formally self-dual codes
- New lower bounds on \(q\)-ary error-correcting codes
- Directed graph representation of half-rate additive codes over \(\text{GF}(4)\)
- Fundamentals of coding type problems
- Isometry groups of additive codes over finite fields
- Additive quaternary codes related to exceptional linear quaternary codes
- On a class of skew constacyclic codes over mixed alphabets and applications in constructing optimal and quantum codes
- On additive MDS codes over small fields
- Perfect 2‐colorings of Hamming graphs
- Additive one-rank hull codes over finite fields
- Additive conjucyclic codes over a class of Galois rings
- An asymptotic property of quaternary additive codes
- Computer classification of linear codes based on lattice point enumeration
- Multispreads
- \(\mathbb{Z}_p(\mathbb{Z}_p + u\mathbb{Z}_p + u^2\mathbb{Z}_p)\)-additive cyclic codes
- On -rank additive intersection pairs (RAIP) of codes
- The nonexistence of an additive quaternary \([15, 5, 9]\)-code
- A geometric non-existence proof of an extremal additive code
- Formally self-dual additive codes over \(\mathbb F_4\)
This page was built for publication: Small additive quaternary codes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1427965)
