English
Related papers

Related papers: New quantum codes from constacyclic codes over fin…

200 papers

In this article, we investigate properties of cyclic codes over a finite non-chain ring $\mathbb{F}_q+v\mathbb{F}_q+v^2\mathbb{F}_q+v^3\mathbb{F}_q+v^4\mathbb{F}_q,$ where $q=p^r,$ $r$ is a positive integer, $p$ is an odd prime, $4 \mid…

Information Theory · Computer Science 2021-12-30 Djoko Suprijanto , Hopein Christofen Tang

This study aims to determine the algebraic structures of $\alpha$-constacyclic codes of length $3p^s$ over the finite commutative non-chain ring $\mathcal{R}=\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}$, for a prime $p…

Combinatorics · Mathematics 2025-04-03 Divya Acharya , Prasanna Poojary , Vadiraja Bhatta G R

In the last 60 years coding theory has been studied a lot over finite fields $\mathbb{F}_q$ or commutative rings $\mathcal{R}$ with unity. Although in $1993$, a study on the classification of the rings (not necessarily commutative or ring…

Information Theory · Computer Science 2022-08-19 Sourav Deb , Isha Kikani , Manish K Gupta

In this paper, we study quasi-twisted codes and their relationship with additive constacyclic codes through a polynomial-based approach. We first present a polynomial characterization of quasi-twisted codes over finite fields analogous to…

Information Theory · Computer Science 2026-03-09 Kanat Abdukhalikov , Gyanendra K. Verma

It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes. This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be…

Information Theory · Computer Science 2023-01-09 Chaofeng Guan , Ruihu Li , Liangdong Lu , Yu Yao

We prove that any Hermitian self-orthogonal $[n,k,d]_{q^2}$ code gives rise to an $[n,k,d]_{q^2}$ code with $\ell$ dimensional Hermitian hull for $0\le \ell \le k$. We present a new method to construct Hermitian self-orthogonal…

Information Theory · Computer Science 2021-05-20 Lin Sok

We present a strong connection between quantum information and quantum permutation groups. Specifically, we define a notion of quantum isomorphisms of graphs based on quantum automorphisms from the theory of quantum groups, and then show…

Quantum Physics · Physics 2018-04-02 Martino Lupini , Laura Mančinska , David E. Roberson

In this paper, two classes of quantum MDS codes are constructed. The main tools are multiplicative structures on finite fields. Carefully choosing different cosets can make the corresponding generalized Reed-Solomon codes Hermitian…

Information Theory · Computer Science 2024-10-24 Puyin Wang , Jinquan Luo

We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…

Information Theory · Computer Science 2010-02-15 Kenza Guenda

For any different odd primes $\ell$ and $p$, structure of constacyclic codes of length $2\ell^mp^n$ over a finite field $\mathbb F_q$ of characteritic $p$ and their duals is established in term of their generator polynomials. Among other…

Information Theory · Computer Science 2014-06-10 Bocong Chen , Hai Q. Dinh , Hongwei Liu

Let $R$ be a commutative local finite ring. In this paper, we construct the complete set of pairwise orthogonal primitive idempotents of $R[X]/<g>$ where $g$ is a regular polynomial in $R[X]$. We use this set to decompose the ring…

Information Theory · Computer Science 2019-08-21 Mohammed Elhassani Charkani , Joël Kabore

It is known that the Hermitian varieties are codewords in the code defined by the points and hyperplanes of the projective spaces $PG(r,q^2)$. In finite geometry, also quasi-Hermitian varieties are defined. These are sets of points of…

Combinatorics · Mathematics 2017-06-22 A. Aguglia , D. Bartoli , L. Storme , Zs. Weiner

Let $\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^k)$-constacyclic codes over the ring $\mathcal{R}=\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p+u^{3}\mathbb{F}_{p}+\cdots+u^{k}\mathbb{F}_{p}$ where…

Information Theory · Computer Science 2019-04-18 Zahid Raza , Amrina Rana

Due to their rich algebraic structure, cyclic codes have a great deal of significance amongst linear codes. Duadic codes are the generalization of the quadratic residue codes, a special case of cyclic codes. The $m$-adic residue codes are…

Information Theory · Computer Science 2024-05-28 Ferhat Kuruz , Mustafa Sarı , Mehmet E. Koroglu

In this paper, we construct an infinite family of five-weight codes from trace codes over the ring $R=\mathbb{F}_2+u\mathbb{F}_2$, where $u^2=0.$ The trace codes have the algebraic structure of abelian codes. Their Lee weight is computed by…

Information Theory · Computer Science 2018-02-28 Minjia Shi , Liqin Qian , Patrick Sole

In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…

Information Theory · Computer Science 2021-11-11 Martino Borello , Wolfgang Willems

Let $\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^2)$-constacyclic codes over the ring $\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p$, where $u^3=u$. We describe generator polynomials of this kind…

Information Theory · Computer Science 2015-06-25 Hojjat Mostafanasab , Negin Karimi

For $\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\lambda$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some…

Information Theory · Computer Science 2012-12-18 Aicha Batoul , Kenza Guenda , T. Aaron Gulliver

One of the central tasks in quantum error-correction is to construct quantum codes that have good parameters. In this paper, we construct three new classes of quantum MDS codes from classical Hermitian self-orthogonal generalized…

Information Theory · Computer Science 2015-08-06 Tao Zhang , Gennian Ge

The Grassmannian is an important object in Algebraic Geometry. One of the many techniques used to study the Grassmannian is to build a vector space from its points in the projective embedding and study the properties of the resulting linear…

Information Theory · Computer Science 2021-11-02 Fernando Piñero González , Doel Rivera Laboy