activity
20172022
most citedTowards the Capacity of Private Information Retrieval from Coded and Colluding Servers

22 citations · 47 across the 11 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

cs.IT2021

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…

cs.IT2021

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…

cs.IT2021

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.…

cs.IT2021

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…

cs.IT2021

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…