English
Related papers

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

200 papers

The geometric and algebraic properties of Gray categories with duals are investigated by means of a diagrammatic calculus. The diagrams are three-dimensional stratifications of a cube, with regions, surfaces, lines and vertices labelled by…

Quantum Algebra · Mathematics 2024-09-24 John W. Barrett , Catherine Meusburger , Gregor Schaumann

For any prime $p$, $\lambda$-constacyclic codes of length $p^s$ over ${\cal R}=\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}$ are precisely the ideals of the local ring ${\cal R}_{\lambda}=\frac{{\cal R}[x]}{\left\langle x^{p^s}-\lambda…

Information Theory · Computer Science 2016-12-13 Hongwei Liu , Maouche Youcef

The correspondence between linear codes and representable matroids is well known. But a similar correspondence between quantum codes and matroids is not known. We show that representable symplectic matroids over a finite field…

Quantum Physics · Physics 2011-04-07 Pradeep Sarvepalli

Codes over Galois rings have been studied extensively during the last three decades. Negacyclic codes over $GR(2^a,m)$ of length $2^s$ have been characterized: the ring $\mathcal{R}_2(a,m,-1)= \frac{GR(2^a,m)[x]}{\langle x^{2^s}+1\rangle}$…

Information Theory · Computer Science 2017-08-16 Hongwei Liu , Youcef Maouche

A simple construction of quaternary hermitian self-orthogonal codes with parameters $[2n+1,k+1]$ and $[2n+2,k+2]$ from a given pair of self-orthogonal $[n,k]$ codes, and its link to quantum codes is considered. As an application, an optimal…

Information Theory · Computer Science 2013-12-10 Vladimir D. Tonchev

Classes of self-dual codes and dual-containing codes are constructed. The codes are obtained within group rings and, using an isomorphism between group rings and matrices, equivalent codes are obtained in matrix form. Distances and other…

Information Theory · Computer Science 2007-11-27 Ted Hurley

We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these…

Combinatorics · Mathematics 2008-01-09 Lars Eirik Danielsen , Matthew G. Parker

Quantum maximum-distance-separable (MDS for short) codes are an important class of quantum codes. In this paper, by using Hermitian self-orthogonal generalized Reed-Solomon (GRS for short) codes, we construct five new classes of $q$-ary…

Information Theory · Computer Science 2023-07-11 Ruhao Wan , Shixin Zhu

In this work, quadratic reside codes over the ring F2 +uF2 +u^2F2 with u^3 = u are considered. A duality and distance preserving Gray map from F2 + uF2 + u^2F2 to (F_2)^3 is defined. By using quadratic double circulant, quadratic bordered…

Information Theory · Computer Science 2016-02-25 Abidin Kaya , Bahattin Yildiz , Irfan Siap

For a prime $p$ and a positive integer $m$, let $\mathbb{F}_{p^m}$ be the finite field of characteristic $p$, and $\mathfrak{R}_l:=\mathbb{F}_{p^m}[v]/\langle v^l-v\rangle$ be a non-chain ring. In this paper, we study the…

Information Theory · Computer Science 2023-12-14 Ashutosh Singh , Priyanka Sharma , Om Prakash

Let $p$ be an odd prime number, $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$ and $s$ a positive integer. Using some combinatorial identities, we obtain certain properties for Kronecker product of matrices over $\mathbb{F}_p$…

Information Theory · Computer Science 2019-07-17 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Somphong Jitman

Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. To get $q$-ary quantum MDS codes, it suffices to find linear MDS codes $C$ over $\mathbb{F}_{q^2}$ satisfying $C^{\perp_H}\subseteq C$ by the Hermitian…

Information Theory · Computer Science 2014-03-12 Bocong Chen , San Ling , Guanghui Zhang

Gray codes for vector spaces are considered in two graphs: the Grassmann graph, and the projective-space graph, both of which have recently found applications in network coding. For the Grassmann graph, constructions of cyclic optimal codes…

Information Theory · Computer Science 2013-06-12 Moshe Schwartz

A linear code of length $n$ over a finite chain ring $R$ with residue field $\F_q$ is a $R$-submodule of $R^n$. A $R$-linear code is a code over $\F_q$ (not necessarily linear) which is the generalized Gray map image of a linear code over…

Information Theory · Computer Science 2025-12-03 Cristina Fernández-Córdoba , Sergi Sánchez-Aragón , Mercè Villanueva

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$,…

Information Theory · Computer Science 2018-03-22 Liangdong Lu , Wenping Ma , Ruihu Li , Yuena Ma , Luobin Guo

In this paper we introduce the notion of $\lambda$-constacyclic codes over finite rings $R$ for arbitary element $\lambda$ of $R$. We study the non-invertible-element constacyclic codes (NIE-constacyclic codes) over finite principal ideal…

Information Theory · Computer Science 2020-11-25 Hongwei Liu , Jingge Liu

This paper considers a new alphabet set, which is a ring that we call $\mathbb{F}_4R$, to construct linear error-control codes. Skew cyclic codes over the ring are then investigated in details. We define a nondegenerate inner product and…

Information Theory · Computer Science 2021-03-01 Nasreddine Benbelkacem , Martianus Frederic Ezerman , Taher Abualrub , Aicha Batoul

Let $f(u)$ and $g(v)$ be any two polynomials of degree $k$ and $\ell$ respectively ($k$ and $\ell$ are not both $1$), which split into distinct linear factors over $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u,v]/\langle…

Information Theory · Computer Science 2018-11-06 Mokshi Goyal , Madhu Raka

In this paper, we mainly study the theory of linear codes over the ring $R =\mathbb{Z}_4+u\mathbb{Z}_4+v\mathbb{Z}_4+uv\mathbb{Z}_4$. By the Chinese Remainder Theorem, we have $R$ is isomorphic to the direct sum of four rings…

Information Theory · Computer Science 2016-01-19 Ping Li , Xuemei Guo , Shixin Zhu

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$ and $s$ a positive integer. Using properties for Kronecker product of matrices and calculation for linear equations over $\mathbb{F}_{2^m}$, an efficient method for the…

Information Theory · Computer Science 2018-11-28 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Somphong Jitman
‹ Prev 1 3 4 5 6 7 10 Next ›