Junli Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Junli Wang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Ruihu Li
Department of Basic Science, Air Force Engineering University, Xi’an, CHINA
7 shared publications - Jingjie Lv
School of Electrical Engineering and Intelligentization, Dongguan University of Technology, Dongguan, China
4 shared publications - Hao Song
Fundamentals Department, Air Force Engineering University, Xi’an, People’s Republic of China
3 shared publications - Yang Liu
Fundamentals Department, Air Force Engineering University, Xi’an, People’s Republic of China
3 shared publications - Guanmin Guo
Department of Basic Sciences, Air Force Engineering University, Xi’an, People’s Republic of China
2 shared publications
Latest Publications
- 30 July 2020
- Published by Springer Nature in Quantum Information Processing
- Vol. 19 (8) , 1-25
Constructions of quasi-twisted quantum codes
- 30 July 2020
- Published by Springer Nature in Quantum Information Processing
- Vol. 19 (8) , 1-25
Constructions of quasi-twisted quantum codes
- 6 June 2020
- Published by Springer Nature in Quantum Information Processing
- Vol. 19 (7) , 1-22
Some construction of entanglement-assisted quantum MDS codes
- 6 June 2020
- Published by Springer Nature in Quantum Information Processing
- Vol. 19 (7) , 1-22
Some construction of entanglement-assisted quantum MDS codes
- 16 March 2020
- Published by Springer Nature in Quantum Information Processing
- Vol. 19 (5) , 1-18
Entanglement-assisted quantum codes from cyclic codes and negacyclic codes
- 16 March 2020
- Published by Springer Nature in Quantum Information Processing
- Vol. 19 (5) , 1-18
Entanglement-assisted quantum codes from cyclic codes and negacyclic codes
- 2 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 24 (5) , 1067-1071
An Explicit Construction of Quantum Stabilizer Codes From Quasi-Cyclic Codes
In this short paper, our main objective is to construct good quantum stabilizer codes over small fields, which have a more potential possibility to be employed in actual quantum processors. We firstly consider a suitable class of two-generators quasi-cyclic (QC) codes and determine their parameters. Then by virtue of their symplectic dual algebraic structure, we derive a sufficient condition to be symplectic dual-containing of these codes. Subsequently, an explicit construction of stabilizer codes from quasi-cyclic codes is presented. As for computational results, we provide many stabilizer codes with good parameters over binary, ternary and quaternary fields that all can not be deduced by the quantum Gilbert-Varshamov (GV) bound. In the binary case, our several codes strictly improve the lower bounds on the minimum distance in current records. In the ternary and quaternary occasions, numerous codes fill some gaps or have better parameters than the current results.
- 2 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 24 (5) , 1067-1071
An Explicit Construction of Quantum Stabilizer Codes From Quasi-Cyclic Codes
In this short paper, our main objective is to construct good quantum stabilizer codes over small fields, which have a more potential possibility to be employed in actual quantum processors. We firstly consider a suitable class of two-generators quasi-cyclic (QC) codes and determine their parameters. Then by virtue of their symplectic dual algebraic structure, we derive a sufficient condition to be symplectic dual-containing of these codes. Subsequently, an explicit construction of stabilizer codes from quasi-cyclic codes is presented. As for computational results, we provide many stabilizer codes with good parameters over binary, ternary and quaternary fields that all can not be deduced by the quantum Gilbert-Varshamov (GV) bound. In the binary case, our several codes strictly improve the lower bounds on the minimum distance in current records. In the ternary and quaternary occasions, numerous codes fill some gaps or have better parameters than the current results.
- 25 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 24 (3) , 472-476
A New Method of Constructing Binary Quantum Codes From Arbitrary Quaternary Linear Codes
In this paper, a method of constructing Hermitian dual containing quaternary linear codes from general quaternary linear codes is proposed. Based on this result, a construction method of binary linear quantum codes is obtained. Using three cyclic codes and one linear code over F4 that are not Hermitian dual containing, we construct four record breaking binary linear quantum codes. Furthermore, ten new record breaking binary additive quantum codes are derived from these four linear quantum codes by propagation rule.
- 25 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 24 (3) , 472-476
A New Method of Constructing Binary Quantum Codes From Arbitrary Quaternary Linear Codes
In this paper, a method of constructing Hermitian dual containing quaternary linear codes from general quaternary linear codes is proposed. Based on this result, a construction method of binary linear quantum codes is obtained. Using three cyclic codes and one linear code over F4 that are not Hermitian dual containing, we construct four record breaking binary linear quantum codes. Furthermore, ten new record breaking binary additive quantum codes are derived from these four linear quantum codes by propagation rule.
- 1 October 2019
- Published by World Scientific Pub Co Pte Ltd in International Journal of Quantum Information
- Vol. 17 (07) , 1950057
New quantum constacyclic codes with length n=2(qm+1)
- 1 October 2019
- Published by World Scientific Pub Co Pte Ltd in International Journal of Quantum Information
- Vol. 17 (07) , 1950057
New quantum constacyclic codes with length n=2(qm+1)
- 2 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 65 (12) , 7829-7839
Some Nonprimitive BCH Codes and Related Quantum Codes
Let q be a prime power and m ≥ 3 be odd. Suppose that n = q2m−1/a with a|(qm + 1) and 3 ≤ a ≤ 2(q2 −q+1). This paper mainly determines the actual maximum designed distance of Hermitian dual-containing Bose-Chaudhuri-Hocquenghem (BCH) codes over Fq2 of length n. Firstly, we give the maximum designed distance δR m,a of narrow-sense Hermitian dual-containing BCH codes. Secondly, we show that there are also non-narrow-sense ones of designed distance up to δR m,a. It is worth mentioning that our maximum designed distance δR m,a > ⌈a/2⌉δA m, where δA m is given by Aly et al. (IEEE Trans. Inf. Theory, vol. 53, no. 3, pp. 1183-1188, 2007). Thus, many families of Hermitian dual-containing BCH codes with relatively large designed distance are obtained. Using the Hermitian construction to them, we can subsequently construct different classes of nonprimitive quantum codes, which are new in the sense that their parameters are not covered in the literature.
- 2 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 65 (12) , 7829-7839
Some Nonprimitive BCH Codes and Related Quantum Codes
Let q be a prime power and m ≥ 3 be odd. Suppose that n = q2m−1/a with a|(qm + 1) and 3 ≤ a ≤ 2(q2 −q+1). This paper mainly determines the actual maximum designed distance of Hermitian dual-containing Bose-Chaudhuri-Hocquenghem (BCH) codes over Fq2 of length n. Firstly, we give the maximum designed distance δR m,a of narrow-sense Hermitian dual-containing BCH codes. Secondly, we show that there are also non-narrow-sense ones of designed distance up to δR m,a. It is worth mentioning that our maximum designed distance δR m,a > ⌈a/2⌉δA m, where δA m is given by Aly et al. (IEEE Trans. Inf. Theory, vol. 53, no. 3, pp. 1183-1188, 2007). Thus, many families of Hermitian dual-containing BCH codes with relatively large designed distance are obtained. Using the Hermitian construction to them, we can subsequently construct different classes of nonprimitive quantum codes, which are new in the sense that their parameters are not covered in the literature.