22 citations · 47 across the 11 of their papers we have counts for
26 papers
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…
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii +2
Lifted Reed-Solomon and multiplicity codes are classes of codes, constructed from specific sets of -variate polynomials. These codes allow for the design of high-rate codes that…
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…
On the Capacity of Quantum Private Information Retrieval from MDS-Coded and Colluding Servers
Matteo Allaix, Seunghoan Song, Lukas Holzbaur +3
In quantum private information retrieval (QPIR), a user retrieves a classical file from multiple servers by downloading quantum systems without revealing the identity of the file.…
Correctable Erasure Patterns in Product Topologies
Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi +1
Locality enables storage systems to recover failed nodes from small subsets of surviving nodes. The setting where nodes are partitioned into subsets, each allowing for local recove…
High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes
Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha +1
In the classical private information retrieval (PIR) setup, a user wants to retrieve a file from a database or a distributed storage system (DSS) without revealing the file identit…
Decoding of Lifted Affine-Invariant Codes
Lukas Holzbaur, Nikita Polyanskii
Lifted Reed-Solomon codes, a subclass of lifted affine-invariant codes, have been shown to be of high rate while preserving locality properties similar to generalized Reed-Muller c…
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…
Partial MDS Codes with Regeneration
Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi +1
Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure correcting codes that combine locality with strong erasure correction capabilities. We construct PMDS and SD co…
Lifted Multiplicity Codes
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii +2
Lifted Reed-Solomon codes and multiplicity codes are two classes of evaluation codes that allow for the design of high-rate codes that can recover every codeword or information sym…
Lifted Reed-Solomon Codes with Application to Batch Codes
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii +1
Guo, Kopparty and Sudan have initiated the study of error-correcting codes derived by lifting of affine-invariant codes. Lifted Reed-Solomon (RS) codes are defined as the evaluatio…
Secrecy and Accessibility in Distributed Storage
Lukas Holzbaur, Stanislav Kruglik, Alexey Frolov +1
A distributed storage system (DSS) needs to be efficiently accessible and repairable. Recently, considerable effort has been made towards the latter, while the former is usually no…
Computational Code-Based Single-Server Private Information Retrieval
Lukas Holzbaur, Camilla Hollanti, Antonia Wachter-Zeh
A new computational private information retrieval (PIR) scheme based on random linear codes is presented. A matrix of messages from a McEliece scheme is used to query the server wi…
Quantum Private Information Retrieval from Coded and Colluding Servers
Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha +1
In the classical private information retrieval (PIR) setup, a user wants to retrieve a file from a database or a distributed storage system (DSS) without revealing the file identit…
Partial MDS Codes with Local Regeneration
Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi +1
Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure codes that combine locality with strong erasure correction capabilities. We construct PMDS and SD codes where e…
Error Decoding of Locally Repairable and Partial MDS Codes
Lukas Holzbaur, Sven Puchinger, Antonia Wachter-Zeh
In this work it is shown that locally repairable codes (LRCs) can be list-decoded efficiently beyond the Johnson radius for a large range of parameters by utilizing the local error…
On Error Decoding of Locally Repairable and Partial MDS Codes
Lukas Holzbaur, Sven Puchinger, Antonia Wachter-Zeh
We consider error decoding of locally repairable codes (LRC) and partial MDS (PMDS) codes through interleaved decoding. For a specific class of LRCs we investigate the success prob…
Towards the Capacity of Private Information Retrieval from Coded and Colluding Servers
Lukas Holzbaur, Ragnar Freij-Hollanti, Jie Li +1
In this work, two practical concepts related to private information retrieval (PIR) are introduced and coined full support-rank PIR and strongly linear PIR. Being of full support-r…
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…
Cyclic Codes with Locality and Availability
Lukas Holzbaur, Ragnar Freij-Hollanti, Antonia Wachter-Zeh
In this work codes with availability are constructed based on the cyclic \emph{locally repairable code} (LRC) construction by Tamo et al. and their extension to -locality by…
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…
Private Streaming with Convolutional Codes
Lukas Holzbaur, Ragnar Freij-Hollanti, Antonia Wachter-Zeh +1
Recently, information-theoretic private information retrieval (PIR) from coded storage systems has gained a lot of attention, and a general star product PIR scheme was proposed. In…