activity
20072023
most citedPrivate Information Retrieval from Coded Databases with Colluding Servers

258 citations · 705 across the 68 of their papers we have counts for

collaborators
Showing 2016 · cs.ITShow all

10 papers · 2 filters

cs.IT2016★ 258 cited

Private Information Retrieval from Coded Databases with Colluding Servers

Ragnar Freij-Hollanti, Oliver Gnilke, Camilla Hollanti +1

We present a general framework for Private Information Retrieval (PIR) from arbitrary coded databases, that allows one to adjust the rate of the scheme according to the suspected n…

cs.IT2016

Well-Rounded Lattices for Coset Coding in MIMO Wiretap Channels

Oliver W. Gnilke, Amaro Barreal, Alex Karrila +3

The concept of well-rounded lattices has recently found important applications in the setting of a fading single-input single-output (SISO) wiretap channel. It has been shown that,…

cs.IT2016★ 33 cited

CONDENSE: A Reconfigurable Knowledge Acquisition Architecture for Future 5G IoT

Dejan Vukobratovic, Dusan Jakovetic, Vitaly Skachek +5

In forthcoming years, the Internet of Things (IoT) will connect billions of smart devices generating and uploading a deluge of data to the cloud. If successfully extracted, the kno…

cs.IT2016

Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels

Mohamed Taoufiq Damir, Alex Karrila, Laia Amorós +3

The design of lattice coset codes for wiretap channels is considered. Bounds on the eavesdropper's correct decoding probability and information leakage are first revisited. From th…

cs.IT2016

Density of Spherically-Embedded Stiefel and Grassmann Codes

Renaud-Alexandre Pitaval, Lu Wei, Olav Tirkkonen +1

The density of a code is the fraction of the coding space covered by packing balls centered around the codewords. This paper investigates the density of codes in the complex Stiefe…

cs.IT2016

Well-Rounded Lattices for Reliability and Security in Rayleigh Fading SISO Channels

Oliver Wilhelm Gnilke, Ha Thanh Nguyen Tran, Alex Karrila +1

For many wiretap channel models asymptotically optimal coding schemes are known, but less effort has been put into actual realizations of wiretap codes for practical parameters. Bo…

cs.IT2016

Nested Lattice Codes for Vector Perturbation Systems

David A. Karpuk, Amaro Barreal, Oliver W. Gnilke +1

Vector perturbation is an encoding method for broadcast channels in which the transmitter solves a shortest vector problem in a lattice to create a perturbation vector, which is th…

cs.IT2016★ 5 cited

A Connection Between Locally Repairable Codes and Exact Regenerating Codes

Toni Ernvall, Thomas Westerbäck, Ragnar Freij-Hollanti +1

Typically, locally repairable codes (LRCs) and regenerating codes have been studied independently of each other, and it has not been clear how the parameters of one relate to those…

cs.IT2016

Bounds on the Maximal Minimum Distance of Linear Locally Repairable Codes

Antti Pöllänen, Thomas Westerbäck, Ragnar Freij-Hollanti +1

Locally repairable codes (LRCs) are error correcting codes used in distributed data storage. Besides a global level, they enable errors to be corrected locally, reducing the need f…

cs.IT2016

An Approximation of Theta Functions with Applications to Communications

Amaro Barreal, Mohamed Taoufiq Damir, Ragnar Freij-Hollanti +1

Computing the theta series of an arbitrary lattice, and more specifically a related quantity known as the flatness factor, has been recently shown to be important for lattice code…