9 papers
Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes
Perttu Saarela, Matteo Allaix, Ragnar Freij-Hollanti +1
In this work, a flexible and robust private information retrieval (PIR) scheme based on binary non-maximum distance separable (non-MDS) codes is considered. This combines previous…
Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power
Julian Renner, Sven Puchinger, Antonia Wachter-Zeh +2
We define and analyze low-rank parity-check (LRPC) codes over extension rings of the finite chain ring , where is a prime and is a positive integer. LRPC…
Cyclic Flats of Binary Matroids
Ragnar Freij-Hollanti, Matthias Grezet, Camilla Hollanti +1
In this paper, first steps are taken towards characterising lattices of cyclic flats that belong to matroids that can be represented over a prescribed finite f…
Private Information Retrieval Schemes with Regenerating Codes
Julien Lavauzelle, Razane Tajeddine, Ragnar Freij-Hollanti +1
A private information retrieval (PIR) scheme allows a user to retrieve a file from a database without revealing any information on the file being requested. As of now, PIR schemes…
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…
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…