New results on s-extremal additive codes over GF(4) Online publication date: Sun, 25-Apr-2010
by Zlatko G. Varbanov
International Journal of Information and Coding Theory (IJICOT), Vol. 1, No. 4, 2010
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.
Online publication date: Sun, 25-Apr-2010
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Coding Theory (IJICOT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com