Li Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Li Liu has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Lanqiang Li
School of Information and Artificial Intelligence, Anhui Agricultural University, Hefei, China
16 shared publications - Shixin Zhu
Hefei University of Technology
10 shared publications - Tingting Wu
School of Information and Artificial Intelligence, Anhui Agricultural University, Hefei, China
7 shared publications - Fuyin Tian
School of Information and Artificial Intelligence, Anhui Agricultural University, Hefei, China
3 shared publications - Xianhong Xie
School of Information and Computer, Anhui Agricultural University, 230036, Hefei, China
3 shared publications - Yanhui Zhang
School of Mathematics Hefei University of Technology 230009 Hefei China
3 shared publications
Latest Publications
- 3 June 2026
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (5) , 1-30
Several new classes of optimal p-ary cyclic codes
- 3 June 2026
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (5) , 1-30
Several new classes of optimal p-ary cyclic codes
- 26 December 2025
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 37 (6) , 1435-1452
Several new classes of optimal quinary cyclic codes
- 26 December 2025
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 37 (6) , 1435-1452
Several new classes of optimal quinary cyclic codes
- Open Access
Several new classes of optimal p-ary cyclic codes
Cyclic codes, as a crucial subclass of linear codes, exhibit broad applications in communication systems, data storage systems, and consumer electronics, primarily attributed to their well-structured algebraic properties. Let $p$ denote an odd prime with $p\geq5$, and let $m$ be a positive integer. The primary objective of this paper is to construct three novel classes of optimal $p$-ary cyclic codes, denoted as ${\mathcal{C}_p}(0,s,t)$, which possess the parameters $[{p^m} - 1,{p^m} - 2m - 2,4]$. Here, $s$ is defined as $s = \frac{{{p^m}+1}}{2}$, and $t$ satisfies the condition $2 \le t \le {p^m} - 2$. Notably, one of the constructed classes includes certain known optimal quinary cyclic codes as special cases. Furthermore, for the specific case when $p=5$, this paper additionally presents four new classes of optimal cyclic codes ${\mathcal{C}_5}(0,s,t)$.Open AccessSeveral new classes of optimal p-ary cyclic codes
Cyclic codes, as a crucial subclass of linear codes, exhibit broad applications in communication systems, data storage systems, and consumer electronics, primarily attributed to their well-structured algebraic properties. Let $p$ denote an odd prime with $p\geq5$, and let $m$ be a positive integer. The primary objective of this paper is to construct three novel classes of optimal $p$-ary cyclic codes, denoted as ${\mathcal{C}_p}(0,s,t)$, which possess the parameters $[{p^m} - 1,{p^m} - 2m - 2,4]$. Here, $s$ is defined as $s = \frac{{{p^m}+1}}{2}$, and $t$ satisfies the condition $2 \le t \le {p^m} - 2$. Notably, one of the constructed classes includes certain known optimal quinary cyclic codes as special cases. Furthermore, for the specific case when $p=5$, this paper additionally presents four new classes of optimal cyclic codes ${\mathcal{C}_5}(0,s,t)$. - 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (3) , 903-921
A class of BCH codes of length $ n = \frac{q^m-1}{4} $Cyclic codes have been widely used in communication systems and data transmission due to their efficient encoding and decoding algorithms. In particular, BCH codes are a significant class of cyclic codes. This paper mainly studies a class of narrow-sense BCH codes with length $ n = \frac{q^m-1}{4} $ and privodes their parameters. Specifically, we determine the first few largest coset leaders and the weight distributions of some BCH codes. Finally, we obtain some linear codes with good parameters.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (3) , 903-921
A class of BCH codes of length $ n = \frac{q^m-1}{4} $Cyclic codes have been widely used in communication systems and data transmission due to their efficient encoding and decoding algorithms. In particular, BCH codes are a significant class of cyclic codes. This paper mainly studies a class of narrow-sense BCH codes with length $ n = \frac{q^m-1}{4} $ and privodes their parameters. Specifically, we determine the first few largest coset leaders and the weight distributions of some BCH codes. Finally, we obtain some linear codes with good parameters.- 23 September 2024
- Published by Springer Nature in Quantum Information Processing
- Vol. 23 (9) , 1-34
New quantum codes and entanglement-assisted quantum codes from repeated-root cyclic codes of length $2^rp^s$- 23 September 2024
- Published by Springer Nature in Quantum Information Processing
- Vol. 23 (9) , 1-34
New quantum codes and entanglement-assisted quantum codes from repeated-root cyclic codes of length $2^rp^s$- 17 February 2024
- Published by Springer Nature in Cryptography and Communications
- Vol. 16 (4) , 801-823
Optimal quinary cyclic codes with three zeros
- 17 February 2024
- Published by Springer Nature in Cryptography and Communications
- Vol. 16 (4) , 801-823
Optimal quinary cyclic codes with three zeros
- 12 February 2024
- Published by Springer Nature in Quantum Information Processing
- Vol. 23 (2) , 1-21
A rational hierarchical (t,n)-threshold quantum secret sharing scheme
- 12 February 2024
- Published by Springer Nature in Quantum Information Processing
- Vol. 23 (2) , 1-21
A rational hierarchical (t,n)-threshold quantum secret sharing scheme
- Open Access
- 5 February 2024
- Published by Springer Nature in Research Square
Some new quantum MDS codes with large minimum distance
The construction of quantum Maximum Distance Separable (MDS) error-correcting codes is of great significance in practical applications, as it plays a vital role in enhancing the reliability and efficiency of quantum communication and quantum computing. As a result, it remains an active research topic in the field of quantum information science. In this paper, based on generalized Reed-Solomon (GRS) codes and Hermitian construction, we construct two new classes of quantum MDS codes. Our constructed quantum MDS codes are novel in the sense that their parameters differ from all previously known codes. Furthermore, most of our codes exhibit significantly larger minimum distance compared to the existing ones of the same length.
- 5 February 2024
- Published by Springer Nature in Research Square
Open AccessSome new quantum MDS codes with large minimum distance
The construction of quantum Maximum Distance Separable (MDS) error-correcting codes is of great significance in practical applications, as it plays a vital role in enhancing the reliability and efficiency of quantum communication and quantum computing. As a result, it remains an active research topic in the field of quantum information science. In this paper, based on generalized Reed-Solomon (GRS) codes and Hermitian construction, we construct two new classes of quantum MDS codes. Our constructed quantum MDS codes are novel in the sense that their parameters differ from all previously known codes. Furthermore, most of our codes exhibit significantly larger minimum distance compared to the existing ones of the same length.
- 7 December 2023
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 36 (4) , 743-767
Several classes of optimal cyclic codes with three zeros
- 7 December 2023
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 36 (4) , 743-767
Several classes of optimal cyclic codes with three zeros
- 3 October 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (1)
The trace codes of several classes of linear codes
- 3 October 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (1)
The trace codes of several classes of linear codes