Circulant matrices have attracted interest due to their rich algebraic structures and various applications. In this paper, the concept of vector-circulant matrices over finite fields is studied as a generalization of circulant matrices. The algebraic characterization for such matrices has been discussed. As applications, constructions of vector-circulant based additive codes over finite fields have been given together with some examples of optimal additive codes over F 4
It is well known that -circulant matrices with ≠0 can be simultaneously diagonalized by a transform ...
We denote GF_4={0,1,w,w^2} where w^2=w+1. An additive code C over GF_4 of length n is an additive su...
AbstractLet dq(n,k) be the maximum possible minimum Hamming distance of a linear [n,k] code over Fq....
Circulant matrices have attracted interest due to their rich algebraic structures and various applic...
Abstract. In this paper we investigate codes over finite commutative rings R, whose generator matric...
AbstractIt is currently fashionable to construct linear binary codes by specifying a set of generati...
The axioms of fields satisfy over sets of numbers such as , , and . Generally, a set matrix is no...
In this paper, two general methods for constructing self-dual codes are presented. These methods use...
AbstractRings of polynomials RN = Zp[x]/xN − 1 which are isomorphic to ZPN are studied, where p is p...
AbstractThe spectral theory for circulants over R or C is discussed, followed by a discussion of inv...
International audienceDouble polycirculant codes are introduced here as a generalization of double c...
AbstractWe present the conditions under which a symmetric circulant matrix C, with entries from a fi...
It is well known that (Formula presented.) -circulant matrices with (Formula presented.) can be simu...
This paper discusses the foundations of the theory of linear codes defined over finite modules. Two ...
AbstractWe present a complete classification of self-dual doubly circulant codes of any length over ...
It is well known that -circulant matrices with ≠0 can be simultaneously diagonalized by a transform ...
We denote GF_4={0,1,w,w^2} where w^2=w+1. An additive code C over GF_4 of length n is an additive su...
AbstractLet dq(n,k) be the maximum possible minimum Hamming distance of a linear [n,k] code over Fq....
Circulant matrices have attracted interest due to their rich algebraic structures and various applic...
Abstract. In this paper we investigate codes over finite commutative rings R, whose generator matric...
AbstractIt is currently fashionable to construct linear binary codes by specifying a set of generati...
The axioms of fields satisfy over sets of numbers such as , , and . Generally, a set matrix is no...
In this paper, two general methods for constructing self-dual codes are presented. These methods use...
AbstractRings of polynomials RN = Zp[x]/xN − 1 which are isomorphic to ZPN are studied, where p is p...
AbstractThe spectral theory for circulants over R or C is discussed, followed by a discussion of inv...
International audienceDouble polycirculant codes are introduced here as a generalization of double c...
AbstractWe present the conditions under which a symmetric circulant matrix C, with entries from a fi...
It is well known that (Formula presented.) -circulant matrices with (Formula presented.) can be simu...
This paper discusses the foundations of the theory of linear codes defined over finite modules. Two ...
AbstractWe present a complete classification of self-dual doubly circulant codes of any length over ...
It is well known that -circulant matrices with ≠0 can be simultaneously diagonalized by a transform ...
We denote GF_4={0,1,w,w^2} where w^2=w+1. An additive code C over GF_4 of length n is an additive su...
AbstractLet dq(n,k) be the maximum possible minimum Hamming distance of a linear [n,k] code over Fq....