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

Journal of Southeast University

A class of quantum codes over finite fields

Xing Meiju, Hanwu Chen, Jinhua Zhang, Xiao Fang-ying, Wang Shuoxing

Published Jan 1, 2010• 0 citations
OpenAlex

Related papers

A new construction of quantum codes from quasi-cyclic codes over finite fields

Soumak Biswas, Maheshanand Bhaintwal

Indian Journal of Pure and Applied Mathematics•May 16, 2022•3 citations

Two classes of quantum codes from almost MDS codes

Zhonghua Sun, Xinyue Liu, Shixin Zhu

Hermitian dual-containing codes are an important class of linear codes which have important applications in the construction of quantum codes. In this paper, two classes of Hermitian dual-containing almost MDS codes over finite fields are studied. By employing the Hermitian construction, a class of quantum codes with minimum distance [Formula: see text] and a class of quantum codes with minimum distance [Formula: see text] are constructed.

International Journal of Quantum Information•Jul 11, 2023•0 citations

Novel Algebraic Constructions of Nonbinary Structured LDPC Codes over Finite Fields

Keke Liu, Zesong Fei, Jingming Kuang

In this paper, we present three algebraic methods for constructing structured nonbinary LDPC codes over finite fields, among which the first method is based on the multiplicative inverses of nonzero elements in finite fields and gives a class of quasi-cyclic codes with girth 6, the second method gives a class of (3, rho) quasi-cyclic codes with girth 8, the third method gives a class of structured codes with cycles limited. The codes given in examples perform well over AWGN channel and have better performances or far lower computational complexities than the corresponding random Mackay codes or codes algebraically constructed by Shu Lin.

IEEE Vehicular Technology Conference•Sep 1, 2008•6 citations

Quantum codes from linear codes over finite chain rings

Xiusheng Liu, Hualu Liu

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

New Non-Binary Quantum Codes Derived From a Class of Linear Codes

Jian Gao, Yongkang Wang

In this short paper, we consider the non-binary quantum codes construction from a class of linear codes, which are not self-orthogonal over finite fields. As the computational results, new quantum codes [[8, 0, ≥ 4]]3, [[8, 2, ≥ 3]]3, [[11, 1, ≥ 5]]3, [[10, 0, ≥ 5]]4, and [[16, 6, ≥ 4]]4are obtained.

IEEE Access•Jan 1, 2019•11 citations

New quantum codes from matrix-product codes over small fields

Hao Song, Ruihu Li, Yang Liu +1 more

Quantum Information Processing•Jun 25, 2020•5 citations
In this paper, we present three algebraic methods for constructing structured nonbinary LDPC codes over finite fields, among which the first method is based on the multiplicative inverses of nonzero elements in finite fields and gives a class of quasi-cyclic codes with girth 6, the second method gives a class of (3, rho) quasi-cyclic codes with girth 8, the third method gives a class of structured codes with cycles limited. The codes given in examples perform well over AWGN channel and have better performances or far lower computational complexities than the corresponding random Mackay codes or codes algebraically constructed by Shu Lin.