7 citations · 14 across the 17 of their papers we have counts for
18 papers
Affine Subcode Ensemble Decoding for Degeneracy-Aware Quantum Error Correction
Leo Wursthorn, Jonathan Mandelbaum, Sisi Miao +4
Quantum low-density parity-check codes are promising candidates for low-overhead fault-tolerant quantum computing, but degeneracy is known to impair the convergence of belief-propa…
Channel Coding based on Skew Polynomials and Multivariate Polynomials
Hedongliang Liu
This dissertation considers new constructions and decoding approaches for error-correcting codes based on non-conventional polynomials, with the objective of providing new coding s…
A Gröbner Approach to Dual-Containing Cyclic Left Module -Codes over Finite Commutative Frobenius Rings
Hedongliang Liu, Cornelia Ott, Felix Ulmer
For a skew polynomial ring where is a commutative Frobenius ring, an endomorphism of and a -derivation of , we consider cyclic left module codes…
Geometrical Properties of Balls in Sum-Rank Metric
Cornelia Ott, Hedongliang Liu, Antonia Wachter-Zeh
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 interes…
Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix and Applications in Multi-Source Network Coding
Hedongliang Liu, Hengjia Wei, Antonia Wachter-Zeh +1
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-r…
Covering Properties of Sum-Rank Metric Codes
Cornelia Ott, Hedongliang Liu, Antonia Wachter-Zeh
The sum-rank metric can be seen as a generalization of both, the rank and the Hamming metric. It is well known that sum-rank metric codes outperform rank metric codes in terms of t…
Interleaved Prange: A New Generic Decoder for Interleaved Codes
Anmoal Porwal, Lukas Holzbaur, Hedongliang Liu +3
Due to the recent challenges in post-quantum cryptography, several new approaches for code-based cryptography have been proposed. For example, a variant of the McEliece cryptosyste…
Rank-Metric Codes and Their Applications
Hannes Bartz, Lukas Holzbaur, Hedongliang Liu +3
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…
List Decoding of 2-Interleaved Binary Alternant Codes
Chih-Chiang Huang, Hedongliang Liu, Lukas Holzbaur +2
This paper is concerned with list decoding of -interleaved binary alternant codes. The principle of the proposed algorithm is based on a combination of a list decoding algorithm…
Analysis of Communication Channels Related to Physical Unclonable Functions
Georg Maringer, Marvin Xhemrishi, Sven Puchinger +6
Cryptographic algorithms rely on the secrecy of their corresponding keys. On embedded systems with standard CMOS chips, where secure permanent memory such as flash is not available…
Quadratic-Curve-Lifted Reed-Solomon Codes
Hedongliang Liu, Lukas Holzbaur, Nikita Polyanskii +2
Lifted codes are a class of evaluation codes attracting more attention due to good locality and intermediate availability. In this work we introduce and study quadratic-curve-lifte…
Decoding of (Interleaved) Generalized Goppa Codes
Hedongliang Liu, Sabine Pircher, Alexander Zeh +1
Generalized Goppa codes are defined by a code locator set of polynomials and a Goppa polynomial . When the degree of all code locator polynomials in $\mathcal{L…
Decoding of Interleaved Alternant Codes
Lukas Holzbaur, Hedongliang Liu, Alessandro Neri +4
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…
Almost Affinely Disjoint Subspaces
Hedongliang Liu, Nikita Polyanskii, Ilya Vorobyev +1
In this work, we introduce a natural notion concerning finite vector spaces. A family of -dimensional subspaces of , which forms a partial spread, is called almo…
On the Gap between Scalar and Vector Solutions of Generalized Combination Networks
Hedongliang Liu, Hengjia Wei, Sven Puchinger +2
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,…
On the Gap between Scalar and Vector Solutions of Generalized Combination Networks
Hedongliang Liu, Hengjia Wei, Sven Puchinger +2
We study scalar-linear and vector-linear solutions to the generalized combination network. We derive new upper and lower bounds on the maximum number of nodes in the middle layer,…
On Decoding and Applications of Interleaved Goppa Codes
Lukas Holzbaur, Hedongliang Liu, Sven Puchinger +1
Goppa Codes are a well-known class of codes with, among others, applications in code-based cryptography. In this paper, we present a collaborative decoding algorithm for interleave…
Locality in Crisscross Error Correction
Hedongliang Liu, Lukas Holzbaur, Antonia Wachter-Zeh
The cover metric is suitable for describing the resilience against correlated errors in arrays, in particular crisscross errors, which makes it interesting for applications such as…