New results on s-extremal additive codes over GF(4). (26th April 2010)

• Record Type: Journal Article
• Authors: Varbanov, Zlatko G.
• Is Part Of: International journal of information and coding theory. Volume 1:Number 4(2010)
• Page Start: 400
• Page End: 409
• Publication Date: 2010-04-26
• Subjects: s-extremal codes -- additive self-dual codes -- graph code -- lengthening; Coding theory -- Periodicals; Information theory -- Periodicals; 003.54
• Languages: English
• ISSNs: 1753-7703

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.