
Construction and enumeration for selfdual cyclic codes of even length over F_2^m + uF_2^m
Let F_2^m be a finite field of cardinality 2^m, R=F_2^m+uF_2^m (u^2=0) a...
read it

Exponent of Cyclic Codes over 𝔽_q
In this article, we introduce and study the concept of the exponent of a...
read it

On components of a Kerdock code and the dual of the BCH code C_1,3
In the paper we investigate the structure of icomponents of two classes...
read it

Two constructions of optimal pairs of linear codes for resisting side channel and fault injection attacks
Direct sum masking (DSM) has been proposed as a countermeasure against ...
read it

Maximum wcyclic holely group divisible packings with block size three and applications to optical orthogonal codes
In this paper we investigate combinatorial constructions for wcyclic ho...
read it

Finding a Generator Matrix of a Multidimensional Cyclic Code
We generalize Sepasdar's method for finding a generator matrix of twodi...
read it

The GCcontent of a family of cyclic codes with applications to DNAcodes
Given a prime power q and a positive integer r>1 we say that a cyclic co...
read it
On selfduality and hulls of cyclic codes over F_2^m[u]/〈 u^k〉 with oddly even length
Let F_2^m be a finite field of 2^m elements, and R=F_2^m[u]/〈 u^k〉=F_2^m+uF_2^m+...+u^k1F_2^m (u^k=0) where k is an integer satisfying k≥ 2. For any odd positive integer n, an explicit representation for every selfdual cyclic code over R of length 2n and a mass formula to count the number of these codes are given first. Then a generator matrix is provided for the selfdual and 2quasicyclic code of length 4n over F_2^m derived by every selfdual cyclic code of length 2n over F_2^m+uF_2^m and a Gray map from F_2^m+uF_2^m onto F_2^m^2. Finally, the hull of each cyclic code with length 2n over F_2^m+uF_2^m is determined and all distinct selforthogonal cyclic codes of length 2n over F_2^m+uF_2^m are listed.
READ FULL TEXT
Comments
There are no comments yet.