Hedongliang Liu

Ms. Hedongliang Liu

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 May 2022 in Foundations and Trends® in Communications and Information Theory
Verified
Journal Article
Closed access
PDF file
HBHannes Bartz
Hannes Bartz
LHLukas Holzbaur
Lukas Holzbaur
HLHedongliang Liu
Hedongliang Liu
SPSven Puchinger
Sven Puchinger
JRJulian Renner
Julian Renner
AWAntonia Wachter-Zeh
Antonia Wachter-Zeh
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.

10 March 2021 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
HLHedongliang Liu
Hedongliang Liu
HWHengjia Wei
Hengjia Wei
SPSven Puchinger
Sven Puchinger
AWAntonia Wachter-Zeh
Antonia Wachter-Zeh
MSMoshe Schwartz
Moshe Schwartz
We study scalar-linear and vector-linear solutions of the generalized combination network. We derive new upper and lower bounds on the maximum number of nodes in the middle layer, depending on the network parameters and the alphabet size. These bounds improve and extend the parameter range of known bounds. Using these new bounds we present a lower bound and an upper bound on the gap in the alphabet size between optimal scalar-linear and optimal vector-linear network coding solutions. For a fixed network structure, while varying the number of middle-layer nodes r, the asymptotic behavior of the upper and lower bounds shows that the gap is in Θ(log(r)).

1 October 2021 in Finite Fields and Their Applications
Verified
Journal Article
Closed access
HLHedongliang Liu
Hedongliang Liu
NPNikita Polianskii
Nikita Polianskii
IVIlya Vorobyev
Ilya Vorobyev
AWAntonia Wachter-Zeh
Antonia Wachter-Zeh

23 September 2021 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
LHLukas Holzbaur
Lukas Holzbaur
HLHedongliang Liu
Hedongliang Liu
ANAlessandro Neri
Alessandro Neri
SPSven Puchinger
Sven Puchinger
JRJohan Rosenkilde
Johan Rosenkilde
AWAntonia Wachter-Zeh
Antonia Wachter-Zeh
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.

21 September 2022
Verified
Book Chapter
Closed access
PDF file
APAnmoal Porwal
Anmoal Porwal
LHLukas Holzbaur
Lukas Holzbaur
HLHedongliang Liu
Hedongliang Liu
JRJulian Renner
Julian Renner
AWAntonia Wachter-Zeh
Antonia Wachter-Zeh
VWVioletta Weger
Violetta Weger

27 November 2024 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
HLHedongliang Liu
Hedongliang Liu
HWHengjia Wei
Hengjia Wei
AWAntonia Wachter-Zeh
Antonia Wachter-Zeh
MSMoshe Schwartz
Moshe Schwartz
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.