Search

Multi-twisted (MT) additive codes over finite fields constitute an important class of additive codes and are generalizations of cyclic and constacyclic additive codes. In this paper, we employ probabilistic methods and results from groups and geometry to study the asymptotic behavior of the rates and relative Hamming distances of two special subclasses of MT additive codes over finite fields, viz. MT additive self-orthogonal codes and MT additive codes with complementary duals (MT ACD codes) with respect to ordinary, Hermitian, and ⁎ trace bilinear forms. More precisely, let p be an odd prime, q be a prime power coprime to p , v be the multiplicative order of q modulo p , and let η be the largest positive integer such that p η | (q v − 1). Here we establish the existence of asymptotically good infinite sequences of MT additive self-orthogonal and ACD codes of length p α ℓ and block length p α over F q t with p α → ∞ , relative Hamming distance at least δ and rates v p η ℓ t and 2 v p η ℓ t with respect to the aforementioned trace bilinear forms, where ℓ ≥ 1 , t ≥ 2 are integers, F q t is the finite field of order q t and δ is a positive real number satisfying h q t (δ) < 1 2 − 1 2 ℓ t , (here h q t is the q t -ary entropy function). This shows that MT additive self-orthogonal and ACD codes over finite fields are asymptotically good. As a special case, we deduce that constacyclic additive self-orthogonal and ACD codes over finite fields are asymptotically good. [ABSTRACT FROM AUTHOR]