Wenhao Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wenhao Liu has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Hanxu Hou
Dongguan University of Technology, Dongguan, China
2 shared publications - Zhengyi Jiang
Department of Mathematics Sciences, Tsinghua University, Beijing, China
2 shared publications - Zhongyi Huang
Tsinghua University, Beijing, China
2 shared publications - Linqi Song
City University of Hong Kong
1 shared publication - Weitao Xu
Department of Computer Science, City University of Hong Kong, Hong Kong, Hong Kong
1 shared publication
Latest Publications
- 10 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 5574-5589
Efficient Encoding/Decoding Algorithms for Irreducible Polynomial Remainder Codes via Additive FFT
Polynomial remainder codes form a class of linear codes constructed based on the Chinese Remainder Theorem over polynomial rings, with Reed-Solomon codes as a special case. In particular, irreducible polynomial remainder codes are those where the moduli are pairwise coprime irreducible polynomials. This paper presents an efficient encoding and decoding method for irreducible polynomial remainder codes over F2m, leveraging the additive Fast Fourier Transform (additive FFT). The proposed approach achieves a computational complexity of O(N log2(N − K)), where N and K denote the code length and dimension, with the additional requirement that N − K < 2m−1 and N − K is a power of 2. This substantially outperforms the best known algorithm for such codes, which has a complexity of O(N2). Furthermore, we conduct a non-asymptotic complexity comparison under specific parameters, with numerical results demonstrating that the proposed algorithms effectively reduces computational complexity. For example, with code length N = 256 and dimension K = 224, our method achieves an approximately 83% reduction in multiplicative complexity for encoding and a 50% reduction for decoding compared to the state-of-the-art approach for polynomial remainder codes.
- 10 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 5574-5589
Efficient Encoding/Decoding Algorithms for Irreducible Polynomial Remainder Codes via Additive FFT
Polynomial remainder codes form a class of linear codes constructed based on the Chinese Remainder Theorem over polynomial rings, with Reed-Solomon codes as a special case. In particular, irreducible polynomial remainder codes are those where the moduli are pairwise coprime irreducible polynomials. This paper presents an efficient encoding and decoding method for irreducible polynomial remainder codes over F2m, leveraging the additive Fast Fourier Transform (additive FFT). The proposed approach achieves a computational complexity of O(N log2(N − K)), where N and K denote the code length and dimension, with the additional requirement that N − K < 2m−1 and N − K is a power of 2. This substantially outperforms the best known algorithm for such codes, which has a complexity of O(N2). Furthermore, we conduct a non-asymptotic complexity comparison under specific parameters, with numerical results demonstrating that the proposed algorithms effectively reduces computational complexity. For example, with code length N = 256 and dimension K = 224, our method achieves an approximately 83% reduction in multiplicative complexity for encoding and a 50% reduction for decoding compared to the state-of-the-art approach for polynomial remainder codes.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74, 15509-15521
Criss-Cross Burst-Deletion Correcting Codes With Optimal Redundancy and En/Decoding Complexity $\mathcal{O}(n^{2})$- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74, 15509-15521
Criss-Cross Burst-Deletion Correcting Codes With Optimal Redundancy and En/Decoding Complexity $\mathcal{O}(n^{2})$