Results 21 to 30 of about 1,535,218 (92)

Gray Images of Constacyclic Codes Over Some Polynomial Residue Rings

open access: yesپژوهش‌های ریاضی, 2021
Let  be the quotient ring    where  is the finite field of size   and  is a positive integer. A Gray map  of length  over  is a special map from  to ( .
Reza Sobhani
doaj  

(1+u) constacyclic and cyclic codes over F2+uF2 [PDF]

open access: yes, 2005
We introduce (1+u) constacyclic and cyclic codes over the ring F2+uF2={0,1,u,ū=u+1}, where u2=0, and study them by analogy with the Z4 case. We prove that the Gray image of a linear (1+u) constacyclic code over F2+uF2 of length n is a binary distance ...
Jian-Fa Qian   +5 more
core   +1 more source

Construction of New Matrix-Product Codes and Their Applications

open access: yesIEEE Access, 2019
In this paper, from special code chains $\mathcal {C}_{1} \supseteq \mathcal {C}_{2}~\supseteq \mathcal {C}_{3}$ such that $\mathcal {C}^{\bot _{h}}_{1}\subseteq \mathcal {C}_{3}$ and $\mathcal {C}^{\bot _{h}}_{2}\subseteq \mathcal {C}_{2}$ , some ...
Hao Song   +3 more
doaj   +1 more source

A family of constacyclic codes over a class of non-chain rings A q,r and new quantum codes

open access: yes, 2021
International audienceFor a prime p, let F q 2 be the finite field of q 2 elements where q = p m and m ≥ 1 is an integer. In this paper, we study constacyclic and skew constacyclic codes of length n over a class of finite commutative non-chain rings A q ...
Prakash, Om   +3 more
core   +1 more source

On $(n,\sigma)-$equivalence relation between skew constacyclic codes [PDF]

open access: yes, 2023
In this paper we generalize the notion of $n$-equivalence relation introduced by Chen et al. in \cite{Chen2014} to classify constacyclic codes of length $n$ over a finite field $\mathbb{F}_q$, where $q=p^r$ is a prime power, to the case of skew ...
Ou-azzou, Hassan   +2 more
core   +1 more source

A class of constacyclic codes are generalized Reed-Solomon codes

open access: yes, 2022
Maximum distance separable (MDS) codes are optimal in the sense that the minimum distance cannot be improved for a given length and code size. The most prominent MDS codes are generalized Reed-Solomon (GRS) codes. The square $\mathcal{C}^{2}$ of a linear
Liu, Hongwei, Liu, Shengwei
core  

A class of constacyclic codes over Fp+vFp and its Gray image [PDF]

open access: yes, 2011
We introduce a Gray map from Fp+vFp to Fp2 and study (1−2v)-constacyclic codes over Fp+vFp, where v2=v. It is proved that the image of a (1−2v)-constacyclic code of length n over Fp+vFp under the Gray map is a distance-invariant linear cyclic code of ...
Liqi Wang   +3 more
core   +1 more source

Optimal constacyclic locally recoverable codes with minimum distance 2 and constacyclic codes with minimum locality

open access: yes, 2023
A locally recoverable code (for brevity LRC) is a code such that a symbol in any coordinate of a codeword can be repaired by using the symbols in at most r other positions. These codes are used in distributed storage systems by Microsoft Azure and Hadoop
Köroğlu, Mehmet Emin, Zengin, Rabia
core  

About on the obtaining of some quantum code parameters from (−2vm−1 + 1)-constacyclic codes over the ring R = 𝔽q + v𝔽q + · · · + vm−1𝔽q

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
In this study, the hull dimensions of (−2vm−1 +1)-constacyclic codes over the ring R = 𝔽q + v𝔽q + · · · + vm−1𝔽q with vm = v are determined. In addition, by using a special Gray map, a necessary condition is given under which the generator polynomial of ...
Gökgöz Gökhan, Öke Figen
doaj   +1 more source

Home - About - Disclaimer - Privacy