Results 41 to 50 of about 1,045 (128)

On the codes over the Z_3+vZ_3+v^2Z_3

open access: yes, 2015
In this paper, we study the structure of cyclic, quasi-cyclic, constacyclic codes and their skew codes over the finite ring R=Z_3+vZ_3+v^2Z_3, v^3=v. The Gray images of cyclic, quasi-cyclic, skew cyclic, skew quasi-cyclic and skew constacyclic codes over
Cengellenmis, Yasein   +2 more
core   +1 more source

Isodual constacyclic codes

open access: yesFinite Fields and Their Applications, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On optimal constacyclic codes

open access: yesLinear Algebra and its Applications, 2016
In this paper we investigate the class of constacyclic codes, which is a natural generalization of the class of cyclic and negacyclic codes. This class of codes is interesting in the sense that it contains codes with good or even optimal parameters.
openaire   +3 more sources

An overview on skew constacyclic codes and their subclass of LCD codes

open access: yesAdvances in Mathematics of Communications, 2021
Linear complementary dual (LCD) codes were introduced by Massey in 1994 [\textit{X. Yang} and \textit{J. L. Massey}, Discrete Math. 126, No. 1--3, 391--393 (1994; Zbl 0790.94022)] and proved that asymptotically good LCD codes exists [\textit{J. L. Massey}, Discrete Math. 106/107, 337--342 (1992; Zbl 0754.94009)]. From 2016 to 2018, some authors studied
Boulanouar, Ranya   +2 more
openaire   +5 more sources

Non-binary quantum codes from constacyclic codes over š”½q[u1, u2,…,uk]/⟨ui3 = ui, uiuj = ujui⟩

open access: yesOpen Mathematics, 2022
Let q=pmq={p}^{m}, pp be an odd prime, and Rk=Fq[u1,u2,…,uk]/⟨ui3=ui,uiuj=ujui⟩{R}_{k}={{\mathbb{F}}}_{q}\left[{u}_{1},{u}_{2},\ldots ,{u}_{k}]\hspace{-0.08em}\text{/}\hspace{-0.08em}\langle {u}_{i}^{3}={u}_{i},{u}_{i}{u}_{j}={u}_{j}{u}_{i}\rangle ...
Kong Bo, Zheng Xiying
doaj   +1 more source

A class of constacyclic codes are generalized Reed–Solomon codes

open access: yesDesigns, Codes and Cryptography, 2023
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 code $\mathcal{C}$ is the linear code spanned by the component-wise products of every pair of ...
Hongwei Liu 0003, Shengwei Liu
openaire   +3 more sources

Symbol-Triple Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over Fq+uFq+u2Fq

open access: yesMathematics, 2022
Let p be an odd prime, where Ļ‘ and m are positive integers. Let ψ be a nonzero element of the finite field Fq, where q=pm, and R=Fq+uFq+u2Fq(u3=0). In this paper, we determine completely the symbol-triple distances of all ψ-constacyclic codes of length ...
Hai Q. Dinh   +3 more
doaj   +1 more source

On the equivalence of linear cyclic and constacyclic codes

open access: yesDiscrete Mathematics, 2023
We introduce new sufficient conditions for permutation and monomial equivalence of linear cyclic codes over various finite fields. We recall that monomial equivalence and isometric equivalence are the same relation for linear codes over finite fields.
Reza Dastbasteh, Petr Lisonek
openaire   +3 more sources

Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over \({{\mathbb{F}_{p^m}[u]}/{\langle u^3\rangle}}\)

open access: yesMathematics, 2021
Let p be a prime, s, m be positive integers, γ be a nonzero element of the finite field Fpm, and let R=Fpm[u]/⟨u3⟩ be the finite commutative chain ring.
Mohammed E. Charkani   +3 more
doaj   +1 more source

Quantum MDS Codes over Small Fields

open access: yes, 2015
We consider quantum MDS (QMDS) codes for quantum systems of dimension $q$ with lengths up to $q^2+2$ and minimum distances up to $q+1$. We show how starting from QMDS codes of length $q^2+1$ based on cyclic and constacyclic codes, new QMDS codes can be ...
Grassl, Markus, Roetteler, Martin
core   +1 more source

Home - About - Disclaimer - Privacy