New quantum codes from skew constacyclic codes

نویسندگان

چکیده

For an odd prime $ p and positive integers m \ell $, let \mathbb{F}_{p^m} be the finite field with p^{m} elements R_{\ell,m} = \mathbb{F}_{p^m}[v_1,v_2,\dots,v_{\ell}]/\langle v^{2}_{i}-1, v_{i}v_{j}-v_{j}v_{i}\rangle_{1\leq i, j\leq \ell} $. Thus is a commutative non-chain ring of order p^{2^{\ell} m} characteristic In this paper, we aim to construct quantum codes from skew constacyclic over First, discuss structures determine their Euclidean dual codes. Then relation between these duals has been obtained. Finally, help duality-preserving Gray map CSS construction, many MDS better non-binary are obtained as compared best-known available in literature.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Quantum MDS codes constructed from Constacyclic codes

Quantum maximum-distance-separable (MDS) codes are an important class of quantum codes. In this paper, using constacyclic codes and Hermitain construction, we construct some new quantum MDS codes of the form q = 2am + t, n = q 2 +1 a . Most of these quantum MDS codes are new in the sense that their parameters are not covered be the codes available in the literature.

متن کامل

New quantum MDS codes derived from constacyclic codes

Quantum error-correcting codes play an important role in both quantum communication and quantum computation. It has experienced a great progress since the establishment of the connections between quantum codes and classical codes (see [4]). It was shown that the construction of quantum codes can be reduced to that of classical linear error-correcting codes with certain self-orthogonality proper...

متن کامل

New linear codes from constacyclic codes

One of the main challenges of coding theory is to construct linear codes with the best possible parameters. Various algebraic and combinatorial methods along with computer searches are used to construct codes with better parameters. Given the computational complexity of determining the minimum distance of a code, exhaustive searches are not feasible for all but small parameter sets. Therefore, ...

متن کامل

Skew constacyclic codes over Galois rings

We generalize the construction of linear codes via skew polynomial rings by using Galois rings instead of finite fields as coefficients. The resulting non commutative rings are no longer left and right Euclidean. Codes that are principal ideals in quotient rings of skew polynomial rings by a two sided ideals are studied. As an application, skew constacyclic self-dual codes over GR(4) are constr...

متن کامل

Skew constacyclic codes over finite chain rings

Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right divisors of x − λ, where λ is a unit element, are exhibited. When λ = 1, the generators of Euclidean and Hermitian dual codes of such codes are determined tog...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics of Communications

سال: 2023

ISSN: ['1930-5346', '1930-5338']

DOI: https://doi.org/10.3934/amc.2021028