Z<inf>4</inf>Z<inf>4</inf>Z<inf>4</inf> -additive cyclic codes are asymptotically good

Abstract

In this paper, we construct a class of Z4Z4Z4-additive cyclic codes generated by 3-tuples of polynomials. We discuss their algebraic structure and show that generator matrices can be constructed for all codes in this class. We study asymptotic properties of this class of codes by using a Bernoulli random variable. Moreover, let 0 < δ< 1 be a real number such that the entropy h4((k+l+t)δ6)<14, we show that the relative minimum distance converges to δ and the rate of the random codes converges to 1k+l+t, where k, l, and t are pairwise co-prime positive odd integers. Finally, we conclude that the Z4Z4Z4-additive cyclic codes are asymptotically good.