Author： Varbanov Zlatko G.
Publisher： Inderscience Publishers
ISSN： 1753-7703
Source： International Journal of Information and Coding Theory, Vol.1, Iss.4, 2010-04, pp. : 400-409
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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.
Related content
Access to resources
Recommend
Some high-rate linear codes over
By Daskalov R.
Problems of Information Transmission, Vol. 43, Iss. 2, 2007-06 ,pp. :
DNA codes for additive stem similarity
Problems of Information Transmission, Vol. 45, Iss. 2, 2009-06 ,pp. :