AbstractWe investigate negacyclic and cyclic codes of length ps over the finite field Fpa. Negacyclic codes of length ps are precisely the ideals of the chain ring Fpa[x]〈xps+1〉. This structure is then used to obtain the Hamming distance distribution of the class of such negacyclic codes, which also provides Hamming weight distributions and enumerations of several codes. An one-to-one correspondence between negacyclic and cyclic codes is established to carry accordingly those results of negacyclic codes to cyclic codes
International audienceOur purpose is to recall some basic aspects about linear and cyclic codes. We ...
Cyclic codes are an interesting type of linear codes and have wide applications in communication and...
Recently, A. Zeh, A. Wachter-Zeh, M. Gadouleau and S. Bezzateev gave a method to obtain new lower bo...
We investigate negacyclic and cyclic codes of length ps over the finite field Fpa. Negacyclic codes ...
AbstractWe investigate negacyclic and cyclic codes of length ps over the finite field Fpa. Negacycli...
Various kinds of distances of all negacyclic codes of length 2s over Zopf2a are completely determine...
Codes over the ring of integers modulo 4 have been studied by many researchers. Negacyclic codes suc...
Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic code...
The negashift ν of Z4n is defined as the permeation of Z4n such that ν(a0, a1, ...., ai, ...., an-1)...
AbstractWe show that repeated-root cyclic codes over a finite chain ring are in general not principa...
Recently, the minimum Hamming weights of negacyclic and cyclic codes of length p(s) over a finite fi...
For any prime p, all constacyclic codes of length ps over the ring ℛ = Fpm + uFpm are considered. Th...
AbstractThe concept of negacyclic code was recently introduced in Wolfmann (IEEE Trans. Inform. Theo...
We study the hulls of cyclic and negacyclic codes of length n over a finite field Fq with respect to...
AbstractLet dq(n,k) be the maximum possible minimum Hamming distance of a linear [n,k] code over Fq....
International audienceOur purpose is to recall some basic aspects about linear and cyclic codes. We ...
Cyclic codes are an interesting type of linear codes and have wide applications in communication and...
Recently, A. Zeh, A. Wachter-Zeh, M. Gadouleau and S. Bezzateev gave a method to obtain new lower bo...
We investigate negacyclic and cyclic codes of length ps over the finite field Fpa. Negacyclic codes ...
AbstractWe investigate negacyclic and cyclic codes of length ps over the finite field Fpa. Negacycli...
Various kinds of distances of all negacyclic codes of length 2s over Zopf2a are completely determine...
Codes over the ring of integers modulo 4 have been studied by many researchers. Negacyclic codes suc...
Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic code...
The negashift ν of Z4n is defined as the permeation of Z4n such that ν(a0, a1, ...., ai, ...., an-1)...
AbstractWe show that repeated-root cyclic codes over a finite chain ring are in general not principa...
Recently, the minimum Hamming weights of negacyclic and cyclic codes of length p(s) over a finite fi...
For any prime p, all constacyclic codes of length ps over the ring ℛ = Fpm + uFpm are considered. Th...
AbstractThe concept of negacyclic code was recently introduced in Wolfmann (IEEE Trans. Inform. Theo...
We study the hulls of cyclic and negacyclic codes of length n over a finite field Fq with respect to...
AbstractLet dq(n,k) be the maximum possible minimum Hamming distance of a linear [n,k] code over Fq....
International audienceOur purpose is to recall some basic aspects about linear and cyclic codes. We ...
Cyclic codes are an interesting type of linear codes and have wide applications in communication and...
Recently, A. Zeh, A. Wachter-Zeh, M. Gadouleau and S. Bezzateev gave a method to obtain new lower bo...