F<inf>2</inf>[u] F<inf>2</inf>[u] -additive cyclic codes are asymptotically good

Abstract

Let F2[u] = F2+ uF2, u2= 0. In this paper, we construct a class of F2[u] F2[u] -additive cyclic codes generated by pairs of polynomials. We discuss their algebraic structure and show that generator matrices can be obtained 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 and k and l be co-prime odd positive integers such that the entropy h2((k+l)δ4)<12, we show that the relative minimum distance converges to δ and the rates of the random codes converge to 1k+l. Finally, we conclude that the F2[u] F2[u] -additive cyclic codes are asymptotically good and provide some examples for this class of codes.