Authors: Zlatko G. Varbanov
Addresses: Department of Mathematics and Informatics, University of Veliko Tarnovo, V.Tarnovo 5000, Bulgaria
Abstract: The purpose of this paper is to study s-extremal additive codes over GF(4). The concept of s-extremality was introduced and the s-extremal additive codes with minimum distance up to 4 were classified by Bautista et al. In this paper, our goal is to construct (or classify if possible) new s-extremal codes with minimum distance at least 5. For d = 5, we classify the codes of length 13, and we construct 1,075 new codes of length 14. For d = 6, we classify the codes of length 14, and we construct 5 new codes of length 15. For d = 7, we construct four new codes of length 19.
Keywords: s-extremal codes; additive self-dual codes; graph code; lengthening.
International Journal of Information and Coding Theory, 2010 Vol.1 No.4, pp.400 - 409
Available online: 25 Apr 2010Full-text access for editors Access for subscribers Purchase this article Comment on this article