An asymptotic property of quaternary additive codes

TL;DR

This paper investigates the asymptotic behavior of maximal lengths of quaternary additive codes, introducing a new family with optimal parameters and analyzing their properties using projective geometry.

Contribution

It determines the asymptotic limit of code length ratios and introduces a new family of optimal quaternary additive codes with specific parameters.

Findings

Established the limit $oxed{oxed{ ext{lim sup } n_k(s)/s}}$ for code lengths.

Constructed a new family of codes with parameters $[2^{2k}-1,k,3 imes 2^{2k-2}]_4$.

Binary concatenations of these codes meet the Griesmer bound with equality.

Abstract

Let $n_k(s)$ be the maximal length $n$ such that a quaternary additive $[n,k,n-s]_4$-code exists. We solve a natural asymptotic problem by determining the lim sup $\lambda_k$ of $n_k(s)/s,$ and the smallest value of $s$ such that $n_k(s)/s=\lambda_k.$ Our new family of quaternary additive codes has parameters $[4^k-1,k,4^k-4^{k-1}]_4=[2^{2k}-1,k,3\cdot 2^{2k-2}]_4$ (where $k=l/2$ and $l$ is an odd integer). These are constant-weight codes. The binary codes obtained by concatenation meet the Griesmer bound with equality. The proof is in terms of multisets of lines in $PG(l-1,2).$