Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Digital Content Technology and its Applications

Asymmetric Quantum Codes Derived From Linear over Finite Rings

Jianfa Qian, Wang Zhen

Published Nov 19, 2012• 0 citations
Publisher
DOI
10.4156/jdcta.vol6.issue20.10

Related papers

Quantum codes from linear codes over finite chain rings

Xiusheng Liu, Hualu Liu

arXiv:1704.06375•Quantum Information Processing•Aug 20, 2017•37 citations

Quantum codes from cyclic codes over F3 + vF3

Mohammad Ashraf, Ghulam Mohammad

Let R = F3 + vF3 be a finite commutative ring, where v2 = 1. It is a finite semi-local ring, not a chain ring. In this paper, we give a construction for quantum codes from cyclic codes over R. We derive self-orthogonal codes over F3 as Gray images of linear and cyclic codes over R. In particular, we use two codes associated with a cyclic code over R of arbitrary length to determine the parameters of the corresponding quantum code.

International Journal of Quantum Information•Sep 1, 2014•57 citations

NONBINARY QUANTUM CODES DERIVED FROM GROUP CHARACTER CODES

Jianfa Qian, Lina Zhang

Most of quantum codes have been constructed by using classical linear codes over finite field. However, little is known about the construction of quantum codes via group character codes. In this work, we present the constructions of nonbinary quantum and asymmetric quantum codes based on group character codes, and give explicit parameters for infinite families of nonbinary quantum codes and asymmetric quantum codes. Furthermore, we present families of optimal quantum codes which derived from group character codes.

International Journal of Quantum Information•Jun 1, 2012•10 citations

On the Construction of Asymmetric Quantum Codes

Giuliano G. La Guardia

International Journal of Theoretical Physics•Feb 4, 2014•20 citations

On the ℓ\ellℓ-DLIPs of codes over finite commutative rings

Bhowmick, Sanjit, Alexandre Fotue Tabue, Pal, Joydeb

Generalizing the linear complementary duals, the linear complementary pairs and the hull of codes, we introduce the concept of $\ell$-dimension linear intersection pairs ($\ell$-DLIPs) of codes over a finite commutative ring $(R)$, for some positive integer $\ell$. In this paper, we study $\ell$-DLIP of codes over $R$ in a very general setting by a uniform method. Besides, we provide a necessary and sufficient condition for the existence of a non-free (or free) $\ell$-DLIP of codes over a finite commutative Frobenius ring. In addition, we obtain a generator set of the intersection of two constacyclic codes over a finite chain ring, which helps us to get an important characterization of $\ell$-DLIP of constacyclic codes. Finally, the $\ell$-DLIP of constacyclic codes over a finite chain ring are used to construct new entanglement-assisted quantum error correcting (EAQEC) codes.

arXiv:2204.00905•Apr 2, 2022•0 citations

New asymmetric quantum codes from matrix-product codes

Hualu Liu, Xiusheng Liu, Yuan Yuan

Quantum Information Processing•Jun 4, 2024•2 citations
Most of quantum codes have been constructed by using classical linear codes over finite field. However, little is known about the construction of quantum codes via group character codes. In this work, we present the constructions of nonbinary quantum and asymmetric quantum codes based on group character codes, and give explicit parameters for infinite families of nonbinary quantum codes and asymmetric quantum codes. Furthermore, we present families of optimal quantum codes which derived from group character codes.
Generalizing the linear complementary duals, the linear complementary pairs and the hull of codes, we introduce the concept of ℓ\ellℓ-dimension linear intersection pairs (ℓ\ellℓ-DLIPs) of codes over a finite commutative ring (R)(R)(R), for some positive integer ℓ\ellℓ. In this paper, we study ℓ\ellℓ-DLIP of codes over RRR in a very general setting by a uniform method. Besides, we provide a necessary and sufficient condition for the existence of a non-free (or free) ℓ\ellℓ-DLIP of codes over a finite commutative Frobenius ring. In addition, we obtain a generator set of the intersection of two constacyclic codes over a finite chain ring, which helps us to get an important characterization of ℓ\ellℓ-DLIP of constacyclic codes. Finally, the ℓ\ellℓ-DLIP of constacyclic codes over a finite chain ring are used to construct new entanglement-assisted quantum error correcting (EAQEC) codes.