Hedongliang 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
Hedongliang Liu has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Antonia Wachter-Zeh
Institute for Communications Engineering, Technical University of Munich (TUM), Munich, Germany
12 shared publications - Sven Puchinger
Department of Applied Mathematics and Computer Science, Technical University of Denmark (DTU), Lyngby, Denmark
7 shared publications - Lukas Holzbaur
Technical University of Munich
6 shared publications - Hengjia Wei
School of Mathematics and Statistics Xi'an Jiaotong University 710049 Xi'an China
5 shared publications - Moshe Schwartz
Department of Electrical and Computer Engineering McMaster University L8S 4K1 Hamilton ON Canada
5 shared publications - Julian Renner
Technical University of Munich
3 shared publications
Latest Publications
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (6) , 1723-1741
A Gröbner approach to dual-containing cyclic left module $ (\theta,\delta) $-codes over finite commutative Frobenius rings
For a skew polynomial ring $ R = A[X;\theta, \delta] $ where $ A $ is a commutative Frobenius ring, $ \theta $ an endomorphism of $ A $ and $ \delta $ a $ \theta $-derivation of $ A $, we consider cyclic left module codes $ \mathcal{C} = Rg/Rf\subset R/Rf $ where $ g $ is a left and right divisor of $ f $ in $ R $. In this paper, we derive a parity check matrix when $ A $ is a finite commutative Frobenius ring using only the framework of skew polynomial rings. We consider rings $ A = B[a_1, \ldots, a_s] $ which are free $ B $-modules where the restriction of $ \delta $ and $ \theta $ to $ B $ are polynomial maps. If a Gröbner basis can be computed over $ B $, then we show that all Euclidean and Hermitian dual-containing codes $ \mathcal{C} = Rg/Rf\subset R/Rf $ can be computed using a Gröbner basis. We also give an algorithm to test if the dual code is again a cyclic left module code. We illustrate our approach for rings of order $ 4 $ with non-trivial endomorphism and the Galois ring of characteristic $ 4 $.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (6) , 1723-1741
A Gröbner approach to dual-containing cyclic left module $ (\theta,\delta) $-codes over finite commutative Frobenius rings
For a skew polynomial ring $ R = A[X;\theta, \delta] $ where $ A $ is a commutative Frobenius ring, $ \theta $ an endomorphism of $ A $ and $ \delta $ a $ \theta $-derivation of $ A $, we consider cyclic left module codes $ \mathcal{C} = Rg/Rf\subset R/Rf $ where $ g $ is a left and right divisor of $ f $ in $ R $. In this paper, we derive a parity check matrix when $ A $ is a finite commutative Frobenius ring using only the framework of skew polynomial rings. We consider rings $ A = B[a_1, \ldots, a_s] $ which are free $ B $-modules where the restriction of $ \delta $ and $ \theta $ to $ B $ are polynomial maps. If a Gröbner basis can be computed over $ B $, then we show that all Euclidean and Hermitian dual-containing codes $ \mathcal{C} = Rg/Rf\subset R/Rf $ can be computed using a Gröbner basis. We also give an algorithm to test if the dual code is again a cyclic left module code. We illustrate our approach for rings of order $ 4 $ with non-trivial endomorphism and the Galois ring of characteristic $ 4 $.- 27 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (2) , 895-913
Linearized Reed-Solomon Codes With Support-Constrained Generator Matrix and Applications in Multi-Source Network Coding
Linearized Reed-Solomon (LRS) codes are evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric and therefore are known as maximum sum-rank distance (MSRD) codes. In this work, we give necessary and sufficient conditions for the existence of MSRD codes with a support-constrained generator matrix. The conditions on the support constraints are identical to those for MDS codes and MRD codes. The required field size for an$[n,k]_{q^{m}}$ LRS codes with support-constrained generator matrix is$q\geq \ell +1$ and$m\geq \max _{l\in [\ell]}\{k-1+\log _{q}k, n_{l}\}$ , where$\ell $ is the number of blocks and$n_{l}$ is the size of the l-th block. The special cases of the result coincide with the known results for Reed-Solomon codes and Gabidulin codes. For the support constraints that do not satisfy the necessary conditions, we derive the maximum sum-rank distance of a code whose generator matrix fulfills the constraints. Such a code can be constructed from a subcode of an LRS code with a sufficiently large field size. Moreover, as an application in network coding, the conditions can be used as constraints in an integer programming problem to design distributed LRS codes for a distributed multi-source network.- 27 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (2) , 895-913
Linearized Reed-Solomon Codes With Support-Constrained Generator Matrix and Applications in Multi-Source Network Coding
Linearized Reed-Solomon (LRS) codes are evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric and therefore are known as maximum sum-rank distance (MSRD) codes. In this work, we give necessary and sufficient conditions for the existence of MSRD codes with a support-constrained generator matrix. The conditions on the support constraints are identical to those for MDS codes and MRD codes. The required field size for an$[n,k]_{q^{m}}$ LRS codes with support-constrained generator matrix is$q\geq \ell +1$ and$m\geq \max _{l\in [\ell]}\{k-1+\log _{q}k, n_{l}\}$ , where$\ell $ is the number of blocks and$n_{l}$ is the size of the l-th block. The special cases of the result coincide with the known results for Reed-Solomon codes and Gabidulin codes. For the support constraints that do not satisfy the necessary conditions, we derive the maximum sum-rank distance of a code whose generator matrix fulfills the constraints. Such a code can be constructed from a subcode of an LRS code with a sufficiently large field size. Moreover, as an application in network coding, the conditions can be used as constraints in an integer programming problem to design distributed LRS codes for a distributed multi-source network.- Open Access
Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix and Applications in Multi-Source Network Coding
Linearized Reed-Solomon (LRS) codes are evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric and therefore are known as maximum sum-rank distance (MSRD) codes. In this work, we give necessary and sufficient conditions for the existence of MSRD codes with a support-constrained generator matrix. These conditions are identical to those for MDS codes and MRD codes. The required field size for an $[n,k]_{q^m}$ LRS codes with support-constrained generator matrix is $q\geq \ell+1$ and $m\geq \max_{l\in[\ell]}\{k-1+\log_qk, n_l\}$, where $\ell$ is the number of blocks and $n_l$ is the size of the $l$-th block. The special cases of the result coincide with the known results for Reed-Solomon codes and Gabidulin codes. For the support constraints that do not satisfy the necessary conditions, we derive the maximum sum-rank distance of a code whose generator matrix fulfills the constraints. Such a code can be constructed from a subcode of an LRS code with a sufficiently large field size. Moreover, as an application in network coding, the conditions can be used as constraints in an integer programming problem to design distributed LRS codes for a distributed multi-source network.Open AccessLinearized Reed-Solomon Codes with Support-Constrained Generator Matrix and Applications in Multi-Source Network Coding
Linearized Reed-Solomon (LRS) codes are evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric and therefore are known as maximum sum-rank distance (MSRD) codes. In this work, we give necessary and sufficient conditions for the existence of MSRD codes with a support-constrained generator matrix. These conditions are identical to those for MDS codes and MRD codes. The required field size for an $[n,k]_{q^m}$ LRS codes with support-constrained generator matrix is $q\geq \ell+1$ and $m\geq \max_{l\in[\ell]}\{k-1+\log_qk, n_l\}$, where $\ell$ is the number of blocks and $n_l$ is the size of the $l$-th block. The special cases of the result coincide with the known results for Reed-Solomon codes and Gabidulin codes. For the support constraints that do not satisfy the necessary conditions, we derive the maximum sum-rank distance of a code whose generator matrix fulfills the constraints. Such a code can be constructed from a subcode of an LRS code with a sufficiently large field size. Moreover, as an application in network coding, the conditions can be used as constraints in an integer programming problem to design distributed LRS codes for a distributed multi-source network. - Open Access
Geometrical Properties of Balls in Sum-Rank Metric
The sum-rank metric arises as an algebraic approach for coding in MIMO block-fading channels and multishot network coding. Codes designed in the sum-rank metric have raised interest in applications such as streaming codes, robust coded distributed storage systems and post-quantum secure cryptosystems. The sum-rank metric can be seen as a generalization of the well-known Hamming metric and the rank metric. As a relatively new metric, there are still many open theoretical problems for codes in the sum-rank metric. In this paper we investigate the geometrical properties of the balls with sum-rank radii motivated by investigating covering properties of codes.
Open AccessGeometrical Properties of Balls in Sum-Rank Metric
The sum-rank metric arises as an algebraic approach for coding in MIMO block-fading channels and multishot network coding. Codes designed in the sum-rank metric have raised interest in applications such as streaming codes, robust coded distributed storage systems and post-quantum secure cryptosystems. The sum-rank metric can be seen as a generalization of the well-known Hamming metric and the rank metric. As a relatively new metric, there are still many open theoretical problems for codes in the sum-rank metric. In this paper we investigate the geometrical properties of the balls with sum-rank radii motivated by investigating covering properties of codes.
- 21 September 2022
- Published by Springer Nature
- p. 69-88
Interleaved Prange: A New Generic Decoder for Interleaved Codes
- 21 September 2022
- Published by Springer Nature
- p. 69-88
Interleaved Prange: A New Generic Decoder for Interleaved Codes
- 2 May 2022
- Published by Emerald Publishing in Foundations and Trends® in Communications and Information Theory
- Vol. 19 (3) , 391-546
Rank-Metric Codes and Their Applications
The rank metric measures the distance between two matrices by the rank of their difference. Codes designed for the rank metric have attracted considerable attention in recent years, reinforced by network coding and further motivated by a variety of applications. In code-based cryptography, the hardness of the corresponding generic decoding problem can lead to systems with reduced public-key size. In distributed data storage, codes in the rank metric have been used repeatedly to construct codes with locality, and in coded caching, they have been employed for the placement of coded symbols. This survey gives a general introduction to rank-metric codes, explains their most important applications, and highlights their relevance to these areas of research.
- 2 May 2022
- Published by Emerald Publishing in Foundations and Trends® in Communications and Information Theory
- Vol. 19 (3) , 391-546
Rank-Metric Codes and Their Applications
The rank metric measures the distance between two matrices by the rank of their difference. Codes designed for the rank metric have attracted considerable attention in recent years, reinforced by network coding and further motivated by a variety of applications. In code-based cryptography, the hardness of the corresponding generic decoding problem can lead to systems with reduced public-key size. In distributed data storage, codes in the rank metric have been used repeatedly to construct codes with locality, and in coded caching, they have been employed for the placement of coded symbols. This survey gives a general introduction to rank-metric codes, explains their most important applications, and highlights their relevance to these areas of research.
- Open Access
Rank-Metric Codes and Their Applications
The rank metric measures the distance between two matrices by the rank of their difference. Codes designed for the rank metric have attracted considerable attention in recent years, reinforced by network coding and further motivated by a variety of applications. In code-based cryptography, the hardness of the corresponding generic decoding problem can lead to systems with reduced public-key size. In distributed data storage, codes in the rank metric have been used repeatedly to construct codes with locality, and in coded caching, they have been employed for the placement of coded symbols. This survey gives a general introduction to rank-metric codes, explains their most important applications, and highlights their relevance to these areas of research.
Open AccessRank-Metric Codes and Their Applications
The rank metric measures the distance between two matrices by the rank of their difference. Codes designed for the rank metric have attracted considerable attention in recent years, reinforced by network coding and further motivated by a variety of applications. In code-based cryptography, the hardness of the corresponding generic decoding problem can lead to systems with reduced public-key size. In distributed data storage, codes in the rank metric have been used repeatedly to construct codes with locality, and in coded caching, they have been employed for the placement of coded symbols. This survey gives a general introduction to rank-metric codes, explains their most important applications, and highlights their relevance to these areas of research.
- Open Access
List Decoding of 2-Interleaved Binary Alternant Codes
This paper is concerned with list decoding of $2$-interleaved binary alternant codes. The principle of the proposed algorithm is based on a combination of a list decoding algorithm for (interleaved) Reed-Solomon codes and an algorithm for (non-interleaved) alternant codes. A new upper bound on the decoding radius is derived and the list size is shown to scale polynomially in the code parameters. While it remains an open problem whether this upper bound is achievable, the provided simulation results show that a decoding radius exceeding the binary Johnson radius can be achieved with a high probability of decoding success by the proposed algorithm.
Open AccessList Decoding of 2-Interleaved Binary Alternant Codes
This paper is concerned with list decoding of $2$-interleaved binary alternant codes. The principle of the proposed algorithm is based on a combination of a list decoding algorithm for (interleaved) Reed-Solomon codes and an algorithm for (non-interleaved) alternant codes. A new upper bound on the decoding radius is derived and the list size is shown to scale polynomially in the code parameters. While it remains an open problem whether this upper bound is achievable, the provided simulation results show that a decoding radius exceeding the binary Johnson radius can be achieved with a high probability of decoding success by the proposed algorithm.
- 1 October 2021
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 75
Almost affinely disjoint subspaces
- 1 October 2021
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 75
Almost affinely disjoint subspaces
- 23 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (12) , 8016-8033
Decoding of Interleaved Alternant Codes
Interleaved Reed–Solomon codes admit efficient decoding algorithms which correct burst errors far beyond half the minimum distance in the random errors regime, e.g., by computing a common solution to the Key Equation for each Reed–Solomon code, as described by Schmidt et al. If this decoder does not succeed, it may either fail to return a codeword or miscorrect to an incorrect codeword, and good upper bounds on the fraction of error matrices for which these events occur are known. The decoding algorithm immediately applies to interleaved alternant codes as well, i.e., the subfield subcodes of interleaved Reed–Solomon codes, but the fraction of decodable error matrices differs, since the error is now restricted to a subfield. In this paper, we present new general lower and upper bounds on the fraction of error matrices decodable by Schmidt et al.’s decoding algorithm, thereby making it the only decoding algorithm for interleaved alternant codes for which such bounds are known.
- 23 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (12) , 8016-8033
Decoding of Interleaved Alternant Codes
Interleaved Reed–Solomon codes admit efficient decoding algorithms which correct burst errors far beyond half the minimum distance in the random errors regime, e.g., by computing a common solution to the Key Equation for each Reed–Solomon code, as described by Schmidt et al. If this decoder does not succeed, it may either fail to return a codeword or miscorrect to an incorrect codeword, and good upper bounds on the fraction of error matrices for which these events occur are known. The decoding algorithm immediately applies to interleaved alternant codes as well, i.e., the subfield subcodes of interleaved Reed–Solomon codes, but the fraction of decodable error matrices differs, since the error is now restricted to a subfield. In this paper, we present new general lower and upper bounds on the fraction of error matrices decodable by Schmidt et al.’s decoding algorithm, thereby making it the only decoding algorithm for interleaved alternant codes for which such bounds are known.