Li Chen
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 Chen has a total of 70 co-authors. Here are the top co-authors by number of shared publications:
- Minquan Cheng
Guangxi Normal University
6 shared publications - Congduan Li
School of Electronics and Communication Engineering, Sun Yat-sen University, Shenzhen, China
5 shared publications - Huazi Zhang
Hangzhou Research Center, Huawei Technologies Company Ltd., Hangzhou, China
4 shared publications Jiwei Liang
Sun Yat-sen University
4 shared publications- Martin Bossert
Institute of Communications Engineering, Ulm University, Ulm, Germany
4 shared publications - Xianzhang Wu
College of Computer and Information Science, Fujian Agriculture and Forestry University, Fuzhou, China
4 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (11) , 8342-8356
Progressive Algebraic Soft Decoding of Hermitian Codes
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (11) , 8342-8356
Progressive Algebraic Soft Decoding of Hermitian Codes
- 27 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (6) , 3771-3783
Low-Complexity Algebraic Soft Decoding of Hermitian Codes With Re-Encoding Transform
Algebraic codes are important in communication and storage systems where soft information is limited and decoding efficiency is critical. Among them, algebraic-geometric (AG) codes are promising candidates to replace the widely used Reed-Solomon (RS) codes. However, their more sophisticated algebraic structure results in high decoding complexity, hindering their practical application. This paper proposes a novel interpolation-based algebraic soft decoding (ASD) for one of the most important AG codes - Hermitian codes. Given a designed maximum decoding output list size (OLS), the interpolation module is constructed, and the decoding is formulated as finding a desired Gröbner basis of this module that contains the interpolation polynomial. The re-encoding transform (ReT) specifically designed for ASD is proposed, enabling the modified basis reduction (BR) interpolation to achieve lower complexity. The ReT is formulated by defining Lagrange interpolation polynomials over the Hermitian function fields and appropriately choosing the re-encoding points. By exploiting the linear code property, the ReT transforms a subset of interpolation points to have zero $z$ -coordinates, which allows a common factor to be extracted from the module basis polynomials, thereby simplifying the interpolation. This paper further proposes an improved ReT employing more re-encoding points. It enables the common factor to have a greater degree, yielding a more significant complexity reduction. This also leads to an early termination for the decoding. Theoretical analysis and numerical results demonstrate that the two proposed ReT schemes efficiently facilitate the ASD for Hermitian codes.
- 27 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (6) , 3771-3783
Low-Complexity Algebraic Soft Decoding of Hermitian Codes With Re-Encoding Transform
Algebraic codes are important in communication and storage systems where soft information is limited and decoding efficiency is critical. Among them, algebraic-geometric (AG) codes are promising candidates to replace the widely used Reed-Solomon (RS) codes. However, their more sophisticated algebraic structure results in high decoding complexity, hindering their practical application. This paper proposes a novel interpolation-based algebraic soft decoding (ASD) for one of the most important AG codes - Hermitian codes. Given a designed maximum decoding output list size (OLS), the interpolation module is constructed, and the decoding is formulated as finding a desired Gröbner basis of this module that contains the interpolation polynomial. The re-encoding transform (ReT) specifically designed for ASD is proposed, enabling the modified basis reduction (BR) interpolation to achieve lower complexity. The ReT is formulated by defining Lagrange interpolation polynomials over the Hermitian function fields and appropriately choosing the re-encoding points. By exploiting the linear code property, the ReT transforms a subset of interpolation points to have zero $z$ -coordinates, which allows a common factor to be extracted from the module basis polynomials, thereby simplifying the interpolation. This paper further proposes an improved ReT employing more re-encoding points. It enables the common factor to have a greater degree, yielding a more significant complexity reduction. This also leads to an early termination for the decoding. Theoretical analysis and numerical results demonstrate that the two proposed ReT schemes efficiently facilitate the ASD for Hermitian codes.
- 24 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 6674-6686
Coded Caching Design for D2D Networks With Reduced Subpacketizations
Device-to-Device (D2D) assisted coded caching is a promising approach to improve the communication efficiency over networks. However, the basic D2D coded caching scheme requires a subpacketization size that increases exponentially with the number of users. This is infeasible since the file size needs to be extremely large in the server. It is desirable to design a scheme that achieves a small subpacketization size while keeping the rate low. Recently, D2D placement delivery array (DPDA) was proposed to address the high subpacketization issue of D2D coded caching. This paper investigates the design of DPDA from the perspectives of linear algebraic and additive combinatorics. It is shown that a linear subspace possessing certain property can be employed in the design of DPDA. Based on this, a new D2D coded caching scheme with a subquadratic subpacketization size is derived through shortening the binary Reed-Muller codes. In order to obtain a D2D coded caching scheme with a linear subpacketization size, a new combinatorial structure called proper disjoint 3-term arithmetic progression (3-AP) free set is further introduced, and a deterministic algorithm for constructing it is provided with a polynomial complexity. Both the theoretical and numerical results reveal that the proposed schemes have a superior performance in terms of subpacketization size or transmission rate.
- 24 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 6674-6686
Coded Caching Design for D2D Networks With Reduced Subpacketizations
Device-to-Device (D2D) assisted coded caching is a promising approach to improve the communication efficiency over networks. However, the basic D2D coded caching scheme requires a subpacketization size that increases exponentially with the number of users. This is infeasible since the file size needs to be extremely large in the server. It is desirable to design a scheme that achieves a small subpacketization size while keeping the rate low. Recently, D2D placement delivery array (DPDA) was proposed to address the high subpacketization issue of D2D coded caching. This paper investigates the design of DPDA from the perspectives of linear algebraic and additive combinatorics. It is shown that a linear subspace possessing certain property can be employed in the design of DPDA. Based on this, a new D2D coded caching scheme with a subquadratic subpacketization size is derived through shortening the binary Reed-Muller codes. In order to obtain a D2D coded caching scheme with a linear subpacketization size, a new combinatorial structure called proper disjoint 3-term arithmetic progression (3-AP) free set is further introduced, and a deterministic algorithm for constructing it is provided with a polynomial complexity. Both the theoretical and numerical results reveal that the proposed schemes have a superior performance in terms of subpacketization size or transmission rate.
- Open Access
- 24 March 2026
- Published by Elsevier in Digital Communications and Networks
- Vol. 12 (7) , 1116-1125
Wasserstein Distance-based Interference Characterization and Analysis in NGSO Constellations with Non-homogeneous Stochastic Geometry
- 24 March 2026
- Published by Elsevier in Digital Communications and Networks
- Vol. 12 (7) , 1116-1125
Open AccessWasserstein Distance-based Interference Characterization and Analysis in NGSO Constellations with Non-homogeneous Stochastic Geometry
- 23 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 30 (10897798) , 1190-1194
SCL Decoding of Non-Binary Linear Block Codes
Non-binary linear block codes (NB-LBCs) are an important class of error-correcting codes that are especially competent in correcting burst errors. They have broad applications in modern communications and storage systems. However, efficient soft-decision decoding of these codes remains to be further developed. This paper proposes successive cancellation list (SCL) decoding for NB-LBCs that are defined over a finite field of characteristic two, i.e., F2r , where r is the extension degree. By establishing a one-to-r mapping between the binary composition of each non-binary codeword and r binary polar codewords, SCL decoding of the r polar codes can be performed with a complexity that is sub-quadratic in the codeword length. A simplified path sorting is further proposed to facilitate the decoding. Simulation results on short-length extended Reed-Solomon (eRS) and non-binary extended BCH (NB-eBCH) codes show that SCL decoding can outperform their state-of-the-art soft-decision decoding with fewer finite field arithmetic operations. For length-16 eRS codes, their maximum-likelihood (ML) decoding performances can be approached with a moderate list size.
- 23 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 30 (10897798) , 1190-1194
SCL Decoding of Non-Binary Linear Block Codes
Non-binary linear block codes (NB-LBCs) are an important class of error-correcting codes that are especially competent in correcting burst errors. They have broad applications in modern communications and storage systems. However, efficient soft-decision decoding of these codes remains to be further developed. This paper proposes successive cancellation list (SCL) decoding for NB-LBCs that are defined over a finite field of characteristic two, i.e., F2r , where r is the extension degree. By establishing a one-to-r mapping between the binary composition of each non-binary codeword and r binary polar codewords, SCL decoding of the r polar codes can be performed with a complexity that is sub-quadratic in the codeword length. A simplified path sorting is further proposed to facilitate the decoding. Simulation results on short-length extended Reed-Solomon (eRS) and non-binary extended BCH (NB-eBCH) codes show that SCL decoding can outperform their state-of-the-art soft-decision decoding with fewer finite field arithmetic operations. For length-16 eRS codes, their maximum-likelihood (ML) decoding performances can be approached with a moderate list size.
- 10 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 5489-5503
Improved Successive Cancellation Decoding of Long Polar Codes Through Perturbing a Posteriori LLRs and Its Theoretical Insights
For polar codes, perturbing received information can enhance the successive cancellation (SC) decoding performance. This is an effective approach for realizing low-latency yet high performance for long polar codes, since all the perturbation-enhanced SC (PSC) decoding can be performed in parallel. This paper provides theoretical insights into soft information perturbation, revealing that the PSC decoding can be equivalently interpreted as perturbing the a posteriori log-likelihood ratios (LLRs) of information bits. Such a revelation leads to the design of an improved PSC (IPSC) decoding that yields a lower perturbation complexity. By better utilizing the decoding a posteriori LLRs, a set of possibly erroneous estimations can be formed and further perturbed, resulting in the proposed hybrid PSC (HPSC) decoding. During each new SC decoding attempt, it takes turns to flip the first erroneous bit by introducing a biased perturbation, while the subsequent erroneous estimations are corrected through random perturbations. Our simulation results validate that, for various codeword lengths and rates, the proposed IPSC decoding can achieve a similar performance as the conventional PSC decoding, but yield a significantly reduced perturbation complexity. With the same number of decoding attempts, the proposed HPSC decoding outperforms several state-of-the-art SC-based decoding, such as the thresholded SC-flip (TSCF) decoding and the dynamic SC-flip (DSCF) decoding.
- 10 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 5489-5503
Improved Successive Cancellation Decoding of Long Polar Codes Through Perturbing a Posteriori LLRs and Its Theoretical Insights
For polar codes, perturbing received information can enhance the successive cancellation (SC) decoding performance. This is an effective approach for realizing low-latency yet high performance for long polar codes, since all the perturbation-enhanced SC (PSC) decoding can be performed in parallel. This paper provides theoretical insights into soft information perturbation, revealing that the PSC decoding can be equivalently interpreted as perturbing the a posteriori log-likelihood ratios (LLRs) of information bits. Such a revelation leads to the design of an improved PSC (IPSC) decoding that yields a lower perturbation complexity. By better utilizing the decoding a posteriori LLRs, a set of possibly erroneous estimations can be formed and further perturbed, resulting in the proposed hybrid PSC (HPSC) decoding. During each new SC decoding attempt, it takes turns to flip the first erroneous bit by introducing a biased perturbation, while the subsequent erroneous estimations are corrected through random perturbations. Our simulation results validate that, for various codeword lengths and rates, the proposed IPSC decoding can achieve a similar performance as the conventional PSC decoding, but yield a significantly reduced perturbation complexity. With the same number of decoding attempts, the proposed HPSC decoding outperforms several state-of-the-art SC-based decoding, such as the thresholded SC-flip (TSCF) decoding and the dynamic SC-flip (DSCF) decoding.
- 24 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (11) , 8294-8311
Efficient Ordered Statistics Decoding of BCH Codes Without Gaussian Elimination
Ordered statistics decoding (OSD) can achieve near maximum likelihood (ML) decoding performance for BCH codes. However, Gaussian elimination (GE) that delivers the systematic generator matrix of the code has an uncompromised latency. Addressing this challenge, this paper proposes a low-latency OSD (LLOSD) for BCH codes. Since BCH codes are binary subcodes of Reed-Solomon (RS) codes, codeword candidates can be produced using the RS systematic generator matrix, whose entries can be generated in parallel. By eliminating the non-binary codeword candidates and identifying the ML codeword, the LLOSD yields a lower latency as well as complexity than the OSD. It is shown that the LLOSD can be interpreted as generating the codeoword candidates through systematic encoding of a punctured BCH codeword, explaining its low-complexity feature. Moreover, the segmented variant is proposed to further facilitate the LLOSD. In order to decode long BCH codes, a hybrid soft decoding (HSD) is finally proposed. It integrates the LLOSD and the algebraic Chase decoding that can effectively provide extra TEPs for the LLOSD, enhancing the decoding performance. Both the complexity and performance of the proposed decoding are analyzed, demonstrating their advantage over the relevant state-of-the-art decoding.
- 24 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (11) , 8294-8311
Efficient Ordered Statistics Decoding of BCH Codes Without Gaussian Elimination
Ordered statistics decoding (OSD) can achieve near maximum likelihood (ML) decoding performance for BCH codes. However, Gaussian elimination (GE) that delivers the systematic generator matrix of the code has an uncompromised latency. Addressing this challenge, this paper proposes a low-latency OSD (LLOSD) for BCH codes. Since BCH codes are binary subcodes of Reed-Solomon (RS) codes, codeword candidates can be produced using the RS systematic generator matrix, whose entries can be generated in parallel. By eliminating the non-binary codeword candidates and identifying the ML codeword, the LLOSD yields a lower latency as well as complexity than the OSD. It is shown that the LLOSD can be interpreted as generating the codeoword candidates through systematic encoding of a punctured BCH codeword, explaining its low-complexity feature. Moreover, the segmented variant is proposed to further facilitate the LLOSD. In order to decode long BCH codes, a hybrid soft decoding (HSD) is finally proposed. It integrates the LLOSD and the algebraic Chase decoding that can effectively provide extra TEPs for the LLOSD, enhancing the decoding performance. Both the complexity and performance of the proposed decoding are analyzed, demonstrating their advantage over the relevant state-of-the-art decoding.
- 24 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (10) , 8647-8658
Performance Analysis and Enhanced Chase Decoding of GII-BCH Codes
Generalized integrated interleaved (GII) codes enable an enhanced error-correction over an array of interleaves (component codes) within a single block. Error-correction performance of GII codes can be further improved by utilizing the soft received information. The existing Chase decoding of GII-BCH codes can achieve a significant coding gain over the hard-decision decoding, but at the cost of complexity. Meanwhile, the existing theoretical characterization of its Chase decoding performance remains complex and partially empirical. This paper introduces a new theoretical characterization for Chase decoding performance of GII-BCH codes. With this characterization, it further proposes two new soft-decision decoding methods for GII-BCH codes, including the enhanced Chase decoding (ECD) and the enhanced concatenated Chase decoding (ECCD). They both identify the decoding rounds that are more likely to declare a decoding failure and prioritize allocating the flipped positions to those rounds. In particular, the latter utilizes codewords of a linear block code to cover the least reliable or the second least reliable positions, further improving the error-correction performance over the ECD. With a similar number of test-vectors, both the ECD and ECCD can outperform the existing Chase decoding for GII-BCH codes.
- 24 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (10) , 8647-8658
Performance Analysis and Enhanced Chase Decoding of GII-BCH Codes
Generalized integrated interleaved (GII) codes enable an enhanced error-correction over an array of interleaves (component codes) within a single block. Error-correction performance of GII codes can be further improved by utilizing the soft received information. The existing Chase decoding of GII-BCH codes can achieve a significant coding gain over the hard-decision decoding, but at the cost of complexity. Meanwhile, the existing theoretical characterization of its Chase decoding performance remains complex and partially empirical. This paper introduces a new theoretical characterization for Chase decoding performance of GII-BCH codes. With this characterization, it further proposes two new soft-decision decoding methods for GII-BCH codes, including the enhanced Chase decoding (ECD) and the enhanced concatenated Chase decoding (ECCD). They both identify the decoding rounds that are more likely to declare a decoding failure and prioritize allocating the flipped positions to those rounds. In particular, the latter utilizes codewords of a linear block code to cover the least reliable or the second least reliable positions, further improving the error-correction performance over the ECD. With a similar number of test-vectors, both the ECD and ECCD can outperform the existing Chase decoding for GII-BCH codes.
- 5 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (10) , 8574-8586
Low-Complexity Chase Decoding of Elliptic Codes
This paper proposes two low-complexity Chase (LCC) decoding algorithms for elliptic codes, which are realized by K¨otter’s interpolation and the basis reduction (BR) interpolation, respectively. They are both developed from the perspective of computing the Gr¨obner bases of the interpolation modules. By identifying η unreliable symbols, 2η decoding testvectors are formulated and the corresponding interpolation modules can be defined. The re-encoding transform (ReT) is further introduced to facilitate the interpolation. The LCC-K ¨otter decoding performs interpolation for the common elements, producing an intermediate outcome shared by all test-vectors. The desired Gr¨obner basis w.r.t. each test-vector can be obtained in a binary tree growing fashion. The new interpolation process can start from intermediate nodes of the previously interpolated paths, resulting in a low complexity. But the decoding latency cannot be contained. In contrast, the LCC-BR decoding performs the common computation in basis construction, which partly substantiates the bases for all interpolation modules. The subsequent basis construction and reduction can be performed in parallel. Besides a low complexity, it offers a latency advantage over the LCC-K¨otter decoding. The decoding complexity and latency are analyzed and verified numerically. The LCC decoding performance are also presented, demonstrating their advantage over both the Guruswami-Sudan decoding and the algebraic soft decoding. Moreover, the performance advantage of elliptic codes over the Reed-Solomon (RS) codes is demonstrated.
- 5 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (10) , 8574-8586
Low-Complexity Chase Decoding of Elliptic Codes
This paper proposes two low-complexity Chase (LCC) decoding algorithms for elliptic codes, which are realized by K¨otter’s interpolation and the basis reduction (BR) interpolation, respectively. They are both developed from the perspective of computing the Gr¨obner bases of the interpolation modules. By identifying η unreliable symbols, 2η decoding testvectors are formulated and the corresponding interpolation modules can be defined. The re-encoding transform (ReT) is further introduced to facilitate the interpolation. The LCC-K ¨otter decoding performs interpolation for the common elements, producing an intermediate outcome shared by all test-vectors. The desired Gr¨obner basis w.r.t. each test-vector can be obtained in a binary tree growing fashion. The new interpolation process can start from intermediate nodes of the previously interpolated paths, resulting in a low complexity. But the decoding latency cannot be contained. In contrast, the LCC-BR decoding performs the common computation in basis construction, which partly substantiates the bases for all interpolation modules. The subsequent basis construction and reduction can be performed in parallel. Besides a low complexity, it offers a latency advantage over the LCC-K¨otter decoding. The decoding complexity and latency are analyzed and verified numerically. The LCC decoding performance are also presented, demonstrating their advantage over both the Guruswami-Sudan decoding and the algebraic soft decoding. Moreover, the performance advantage of elliptic codes over the Reed-Solomon (RS) codes is demonstrated.
- 1 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (7) , 5089-5108
Algebraic Chase Decoding of Elliptic Codes With Generalized Re-Encoding Transform and Improved Root-Finding
Algebraic Chase decoding (ACD) is an effective soft-decision decoding approach for elliptic codes. By identifying$\eta $ least reliable symbols,$2^{\eta } $ test-vectors are formulated, each of which will be decoded through the interpolation and root-finding processes. To improve the ACD of elliptic codes, this paper proposes the generalized re-encoding transform (GReT) and improved root-finding (IRF) for reducing the decoding complexity. A systematic encoding method for elliptic codes with an arbitrary information set is proposed to re-encode the received symbols with the most reliable information set (MRIS). By assessing the likelihood of the re-encoded codeword, the ACD can be early terminated, saving the decoding computation for all test-vectors. The GReT, which allows arbitrary selection of re-encoding positions, is further proposed for the ACD in reducing the interpolation complexity. It transforms the interpolation polynomials and points using the Gröbner basis associated to the MRIS. Furthermore, the IRF is proposed to reduce the root-finding complexity that also grows exponentially with$\eta $ . It can directly determine the codeword candidates from the interpolation outcomes and eliminate the restoration of interpolation polynomials in the context of GReT. Our numerical results show that the proposed GReT and IRF significantly reduce the interpolation and root-finding complexity of ACD, respectively. Moreover, with the early termination facilitated by the re-encoding with the MRIS, the average ACD complexity decreases as the channel conditions improve.- 1 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (7) , 5089-5108
Algebraic Chase Decoding of Elliptic Codes With Generalized Re-Encoding Transform and Improved Root-Finding
Algebraic Chase decoding (ACD) is an effective soft-decision decoding approach for elliptic codes. By identifying$\eta $ least reliable symbols,$2^{\eta } $ test-vectors are formulated, each of which will be decoded through the interpolation and root-finding processes. To improve the ACD of elliptic codes, this paper proposes the generalized re-encoding transform (GReT) and improved root-finding (IRF) for reducing the decoding complexity. A systematic encoding method for elliptic codes with an arbitrary information set is proposed to re-encode the received symbols with the most reliable information set (MRIS). By assessing the likelihood of the re-encoded codeword, the ACD can be early terminated, saving the decoding computation for all test-vectors. The GReT, which allows arbitrary selection of re-encoding positions, is further proposed for the ACD in reducing the interpolation complexity. It transforms the interpolation polynomials and points using the Gröbner basis associated to the MRIS. Furthermore, the IRF is proposed to reduce the root-finding complexity that also grows exponentially with$\eta $ . It can directly determine the codeword candidates from the interpolation outcomes and eliminate the restoration of interpolation polynomials in the context of GReT. Our numerical results show that the proposed GReT and IRF significantly reduce the interpolation and root-finding complexity of ACD, respectively. Moreover, with the early termination facilitated by the re-encoding with the MRIS, the average ACD complexity decreases as the channel conditions improve.