Table of Contents
Fetching ...

Combinatorial Constructions of Optimal Quaternary Additive Codes

Chaofeng Guan, Jingjie Lv, Gaojun Luo, Zhi Ma

Abstract

This paper aims to construct optimal quaternary additive codes with non-integer dimensions. Firstly, we propose combinatorial constructions of quaternary additive constant-weight codes, alongside additive generalized anticode construction. Subsequently, we propose generalized Construction X, which facilitates the construction of non-integer dimensional optimal additive codes from linear codes. Then, we construct ten classes of optimal quaternary non-integer dimensional additive codes through these two methods. As an application, we also determine the optimal additive $[n,3.5,n-t]_4$ codes for all $t$ with variable $n$, except for $t=6,7,12$.

Combinatorial Constructions of Optimal Quaternary Additive Codes

Abstract

This paper aims to construct optimal quaternary additive codes with non-integer dimensions. Firstly, we propose combinatorial constructions of quaternary additive constant-weight codes, alongside additive generalized anticode construction. Subsequently, we propose generalized Construction X, which facilitates the construction of non-integer dimensional optimal additive codes from linear codes. Then, we construct ten classes of optimal quaternary non-integer dimensional additive codes through these two methods. As an application, we also determine the optimal additive codes for all with variable , except for .
Paper Structure (7 sections, 22 theorems, 28 equations, 2 figures, 2 tables)

This paper contains 7 sections, 22 theorems, 28 equations, 2 figures, 2 tables.

Key Result

Lemma 1

(Additive Griesmer Bound, Guan2023SomeGQ) If $C_a$ is a quaternary additive $[n,k,d]_4$ code with $k\ge1$, then

Theorems & Definitions (31)

  • Lemma 1
  • Lemma 2
  • Definition 1
  • Lemma 3
  • Remark 1
  • Example 1
  • Lemma 4
  • Lemma 5
  • Lemma 6
  • Lemma 7
  • ...and 21 more