Camilla Hollanti

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Fast Multiplication and the PLWE-RLWE Equivalence for an Infinite Family of Cyclotomic Subextensions 2024 Joonas Ahola
IvĂĄn Blanco-ChacĂłn
Wilmar Bolaños
Antti Haavikko
Camilla Hollanti
Rodrigo MartĂ­n SĂĄnchez-Ledesma
+ PDF Chat Secret Sharing for Secure and Private Information Retrieval: A Construction Using Algebraic Geometry Codes 2024 Okko Makkonen
David Karpuk
Camilla Hollanti
+ PDF Chat Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack 2024 Neehar Verma
Camilla Hollanti
+ PDF Chat Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval 2024 Okko Makkonen
David Karpuk
Camilla Hollanti
+ PDF Chat Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval 2024 Okko Makkonen
David Karpuk
Camilla Hollanti
+ PDF Chat Approximate Gradient Coding for Privacy-Flexible Federated Learning with Non-IID Data 2024 Okko Makkonen
Sampo NiemelÀ
Camilla Hollanti
Serge Kas Hanna
+ PDF Chat Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack 2024 Neehar Verma
Camilla Hollanti
+ General Framework for Linear Secure Distributed Matrix Multiplication With Byzantine Servers 2024 Okko Makkonen
Camilla Hollanti
+ PDF Chat N-Sum Box: An Abstraction for Linear Computation over Many-to-one Quantum Networks 2023 Matteo Allaix
Yuxiang Lu
Yuhang Yao
Tefjol Pllaha
Camilla Hollanti
Syed A. Jafar
+ PDF Chat Euclidean lattices: theory and applications 2023 Lenny Fukshansky
Camilla Hollanti
+ PDF Chat Secure Distributed Gram Matrix Multiplication 2023 Okko Makkonen
Camilla Hollanti
+ Algebraic Geometry Codes for Secure Distributed Matrix Multiplication 2023 Camilla Hollanti
Okko Makkonen
Elif Saçıkara
+ $N$-Sum Box: An Abstraction for Linear Computation over Many-to-one Quantum Networks 2023 Matteo Allaix
Yuxiang Lu
Yuhang Yao
Tefjol Pllaha
Camilla Hollanti
Syed A. Jafar
+ Euclidean lattices: theory and applications 2023 Lenny Fukshansky
Camilla Hollanti
+ PDF Chat General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers 2022 Okko Makkonen
Camilla Hollanti
+ PDF Chat Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed–Muller Codes 2022 Perttu Saarela
Matteo Allaix
Ragnar Freij-Hollanti
Camilla Hollanti
+ PDF Chat Analog Secure Distributed Matrix Multiplication over Complex Numbers 2022 Okko Makkonen
Camilla Hollanti
+ PDF Chat On the Capacity of Quantum Private Information Retrieval From MDS-Coded and Colluding Servers 2022 Matteo Allaix
Seunghoan Song
Lukas Holzbaur
Tefjol Pllaha
Masahito Hayashi
Camilla Hollanti
+ PDF Chat Efficient Recovery of a Shared Secret via Cooperation: Applications to SDMM and PIR 2022 Jie Li
Okko Makkonen
Camilla Hollanti
Oliver W. Gnilke
+ PDF Chat Private and Secure Distributed Matrix Multiplication Schemes for Replicated or MDS-Coded Servers 2022 Jie Li
Camilla Hollanti
+ Analog Secure Distributed Matrix Multiplication over Complex Numbers 2022 Okko Makkonen
Camilla Hollanti
+ Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes 2022 Perttu Saarela
Matteo Allaix
Ragnar Freij-Hollanti
Camilla Hollanti
+ General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers 2022 Okko Makkonen
Camilla Hollanti
+ Secure Distributed Gram Matrix Multiplication 2022 Okko Makkonen
Camilla Hollanti
+ PDF Chat A Generic Transformation for Optimal Node Repair in MDS Array Codes Over F<sub>2</sub> 2021 Jie Li
Xiaohu Tang
Camilla Hollanti
+ PDF Chat Improved Private and Secure Distributed Matrix Multiplication 2021 Jie Li
Camilla Hollanti
+ PDF Chat High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes 2021 Matteo Allaix
Lukas Holzbaur
Tefjol Pllaha
Camilla Hollanti
+ Dense generic well-rounded lattices 2021 Camilla Hollanti
Guillermo Mantilla-Soler
Niklas Miller
+ On the Capacity of Quantum Private Information Retrieval from MDS-Coded and Colluding Servers.zip 2021 Matteo Allaix
Seunghoan Song
Lukas Holzbaur
Tefjol Pllaha
Masahito Hayashi
Camilla Hollanti
+ Improved Private and Secure Distributed (Batch) Matrix Multiplication 2021 Jie Li
Camilla Hollanti
+ PDF Chat Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels 2021 Mohamed Taoufiq Damir
Alex Karrila
Laia AmorĂłs
Oliver W. Gnilke
David Karpuk
Camilla Hollanti
+ High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes 2021 Matteo Allaix
Lukas Holzbaur
Tefjol Pllaha
Camilla Hollanti
+ Cyclic flats of binary matroids 2021 Ragnar Freij-Hollanti
Matthias Grezet
Camilla Hollanti
Thomas WesterbÀck
+ Even Unimodular Lattices from Quaternion Algebras 2021 Laia AmorĂłs
Mohamed Taoufiq Damir
Camilla Hollanti
+ Dense generic well-rounded lattices 2021 Camilla Hollanti
Guillermo Mantilla-Soler
Niklas Miller
+ On the Capacity of Quantum Private Information Retrieval from MDS-Coded and Colluding Servers 2021 Matteo Allaix
Seunghoan Song
Lukas Holzbaur
Tefjol Pllaha
Masahito Hayashi
Camilla Hollanti
+ High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes 2021 Matteo Allaix
Lukas Holzbaur
Tefjol Pllaha
Camilla Hollanti
+ PDF Chat Quantum Private Information Retrieval From Coded and Colluding Servers 2020 Matteo Allaix
Lukas Holzbaur
Tefjol Pllaha
Camilla Hollanti
+ PDF Chat Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power 2020 Julian Renner
Sven Puchinger
Antonia Wachter-Zeh
Camilla Hollanti
Ragnar Freij-Hollanti
+ PDF Chat Computational Code-Based Single-Server Private Information Retrieval 2020 Lukas Holzbaur
Camilla Hollanti
Antonia Wachter-Zeh
+ PDF Chat Towards Practical Private Information Retrieval From MDS Array Codes 2020 Jie Li
David Karpuk
Camilla Hollanti
+ Quantum Private Information Retrieval from Coded and Colluding Servers 2020 Matteo Allaix
Lukas Holzbaur
Tefjol Pllaha
Camilla Hollanti
+ Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power 2020 Julian Renner
Sven Puchinger
Antonia Wachter-Zeh
Camilla Hollanti
Ragnar Freij-Hollanti
+ PDF Chat Private Streaming With Convolutional Codes 2020 Lukas Holzbaur
Ragnar Freij-Hollanti
Antonia Wachter-Zeh
Camilla Hollanti
+ PDF Chat On Fast-Decodable Algebraic Space–Time Codes 2020 Amaro Barreal
Camilla Hollanti
+ PDF Chat An Approximation of Theta Functions with Applications to Communications 2020 Amaro Barreal
Mohamed Taoufiq Damir
Ragnar Freij-Hollanti
Camilla Hollanti
+ Computational Code-Based Single-Server Private Information Retrieval 2020 Lukas Holzbaur
Camilla Hollanti
Antonia Wachter-Zeh
+ Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power 2020 Julian Renner
Sven Puchinger
Antonia Wachter-Zeh
Camilla Hollanti
Ragnar Freij-Hollanti
+ Quantum Private Information Retrieval from Coded and Colluding Servers 2020 Matteo Allaix
Lukas Holzbaur
Tefjol Pllaha
Camilla Hollanti
+ Private Information Retrieval from MDS Array Codes with (Near-) Optimal Repair Bandwidth. 2019 Jie Li
David Karpuk
Camilla Hollanti
+ PDF Chat Private Information Retrieval Over Random Linear Networks 2019 Razane Tajeddine
Antonia Wachter-Zeh
Camilla Hollanti
+ PDF Chat The Complete Hierarchical Locality of the Punctured Simplex Code 2019 Matthias Grezet
Camilla Hollanti
+ Cyclic Flats of Binary Matroids 2019 Ragnar Freij-Hollanti
Matthias Grezet
Camilla Hollanti
Thomas WesterbÀck
+ PDF Chat Uniform Minors in Maximally Recoverable Codes 2019 Matthias Grezet
Thomas WesterbÀck
Ragnar Freij-Hollanti
Camilla Hollanti
+ PDF Chat Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes 2019 Matthias Grezet
Ragnar Freij-Hollanti
Thomas WesterbÀck
Camilla Hollanti
+ On the Capacity of Private Information Retrieval from Coded, Colluding, and Adversarial Servers 2019 Lukas Holzbaur
Ragnar Freij-Hollanti
Camilla Hollanti
+ Towards the Capacity of Private Information Retrieval from Coded and Colluding Servers 2019 Lukas Holzbaur
Ragnar Freij-Hollanti
Jie Li
Camilla Hollanti
+ The Complete Hierarchical Locality of the Punctured Simplex Code. 2019 Matthias Grezet
Camilla Hollanti
+ PDF Chat Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers 2019 Razane Tajeddine
Oliver W. Gnilke
David Karpuk
Ragnar Freij-Hollanti
Camilla Hollanti
+ Cyclic Flats of Binary Matroids 2019 Ragnar Freij-Hollanti
Matthias Grezet
Camilla Hollanti
Thomas WesterbÀck
+ Towards the Capacity of Private Information Retrieval from Coded and Colluding Servers 2019 Lukas Holzbaur
Ragnar Freij-Hollanti
Jie Li
Camilla Hollanti
+ The Complete Hierarchical Locality of the Punctured Simplex Code 2019 Matthias Grezet
Camilla Hollanti
+ Private Information Retrieval Schemes with Regenerating Codes. 2018 Julien Lavauzelle
Razane Tajeddine
Ragnar Freij-Hollanti
Camilla Hollanti
+ PDF Chat Private Streaming with Convolutional Codes 2018 Lukas Holzbaur
Ragnar Freij-Hollanti
Antonia Wachter-Zeh
Camilla Hollanti
+ Private Information Retrieval over Networks. 2018 Razane Tajeddine
Antonia Wachter-Zeh
Camilla Hollanti
+ Private Information Retrieval over Random Linear Networks. 2018 Razane Tajeddine
Antonia Wachter-Zeh
Camilla Hollanti
+ PDF Chat $t$-private information retrieval schemes using transitive codes 2018 Ragnar Freij-Hollanti
Oliver W. Gnilke
Camilla Hollanti
Anna-Lena Trautmann
David Karpuk
Ivo Kubjas
+ Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers 2018 Razane Tajeddine
Oliver W. Gnilke
David Karpuk
Ragnar Freij-Hollanti
Camilla Hollanti
+ Private Streaming with Convolutional Codes 2018 Lukas Holzbaur
Ragnar Freij-Hollanti
Antonia Wachter-Zeh
Camilla Hollanti
+ PDF Chat Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers 2018 Razane Tajeddine
Oliver W. Gnilke
David Karpuk
Ragnar Freij-Hollanti
Camilla Hollanti
+ PDF Chat Coded Caching Clusters with Device-to-Device Communications 2018 Joonas PÀÀkkönen
Amaro Barreal
Camilla Hollanti
Olav Tirkkonen
+ Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures 2018 Matthias Grezet
Ragnar Freij-Hollanti
Thomas WesterbÀck
Oktay Ölmez
Camilla Hollanti
+ Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers 2018 Razane Tajeddine
Oliver W. Gnilke
David Karpuk
Ragnar Freij-Hollanti
Camilla Hollanti
+ PDF Chat Matroid Theory and Storage Codes: Bounds and Constructions 2018 Ragnar Freij-Hollanti
Camilla Hollanti
Thomas WesterbÀck
+ Private Information Retrieval Schemes with Regenerating Codes 2018 Julien Lavauzelle
Razane Tajeddine
Ragnar Freij-Hollanti
Camilla Hollanti
+ Private Information Retrieval over Random Linear Networks 2018 Razane Tajeddine
Antonia Wachter-Zeh
Camilla Hollanti
+ Private Streaming with Convolutional Codes 2018 Lukas Holzbaur
Ragnar Freij-Hollanti
Antonia Wachter-Zeh
Camilla Hollanti
+ Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers 2018 Razane Tajeddine
Oliver W. Gnilke
David Karpuk
Ragnar Freij-Hollanti
Camilla Hollanti
+ Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers 2018 Razane Tajeddine
Oliver W. Gnilke
David Karpuk
Ragnar Freij-Hollanti
Camilla Hollanti
+ PDF Chat Natural orders for asymmetric space–time coding: minimizing the discriminant 2017 Amaro Barreal
Capi Corrales Rodrigåñez
Camilla Hollanti
+ t-Private Information Retrieval Schemes Using Transitive Codes 2017 Ragnar Freij-Hollanti
Oliver W. Gnilke
Camilla Hollanti
Anna-Lena Trautmann
David Karpuk
Ivo Kubjas
+ PDF Chat Density of Spherically Embedded Stiefel and Grassmann Codes 2017 Renaud-Alexandre Pitaval
Lu Wei
Olav Tirkkonen
Camilla Hollanti
+ Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures 2017 Matthias Grezet
Ragnar Freij-Hollanti
Thomas WesterbÀck
Oktay Ölmez
Camilla Hollanti
+ Improved User-Private Information Retrieval via Finite Geometry 2017 Oliver W. Gnilke
Marcus Greferath
Camilla Hollanti
Guillermo Nuñez Ponasso
Padraig Ó Catháin
Eric Swartz
+ PDF Chat Lattice coding for Rician fading channels from Hadamard rotations 2017 Alex Karrila
Niko R. VÀisÀnen
David Karpuk
Camilla Hollanti
+ PDF Chat Private information retrieval schemes for coded data with arbitrary collusion patterns 2017 Razane Tajeddine
Oliver W. Gnilke
David Karpuk
Ragnar Freij-Hollanti
Camilla Hollanti
Salim El Rouayheb
+ Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns 2017 Razane Tajeddine
Oliver W. Gnilke
David Karpuk
Ragnar Freij-Hollanti
Camilla Hollanti
Salim El Rouayheb
+ Lattice coding for Rician fading channels from Hadamard rotations 2017 Alex Karrila
Niko R. VÀisÀnen
David Karpuk
Camilla Hollanti
+ Natural orders for asymmetric space--time coding: minimizing the discriminant 2017 Amaro Barreal
Capi Corrales Rodrigåñez
Camilla Hollanti
+ Traffic Minimizing Caching and Latent Variable Distributions of Order Statistics 2017 Joonas PÀÀkkönen
K. D. P. Dharmawansa
Ragnar Freij-Hollanti
Camilla Hollanti
Olav Tirkkonen
+ PDF Chat On Binary Matroid Minors and Applications to Data Storage over Small Fields 2017 Matthias Grezet
Ragnar Freij-Hollanti
Thomas WesterbÀck
Camilla Hollanti
+ PDF Chat Private Information Retrieval from Coded Databases with Colluding Servers 2017 Ragnar Freij-Hollanti
Oliver W. Gnilke
Camilla Hollanti
David Karpuk
+ Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns 2017 Razane Tajeddine
Oliver W. Gnilke
David Karpuk
Ragnar Freij-Hollanti
Camilla Hollanti
Salim El Rouayheb
+ Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures 2017 Matthias Grezet
Ragnar Freij-Hollanti
Thomas WesterbÀck
Oktay Ölmez
Camilla Hollanti
+ Improved User-Private Information Retrieval via Finite Geometry 2017 Oliver W. Gnilke
Marcus Greferath
Camilla Hollanti
Guillermo Nuñez Ponasso
Padraig Ó Catháin
Eric Swartz
+ Natural orders for asymmetric space--time coding: minimizing the discriminant 2017 Amaro Barreal
Capi Corrales Rodrigåñez
Camilla Hollanti
+ Matroid Theory and Storage Codes: Bounds and Constructions 2017 Ragnar Freij-Hollanti
Camilla Hollanti
Thomas WesterbÀck
+ On Fast-Decodable Algebraic Space--Time Codes 2017 Amaro Barreal
Camilla Hollanti
+ Lattice coding for Rician fading channels from Hadamard rotations 2017 Alex Karrila
Niko R. VÀisÀnen
David Karpuk
Camilla Hollanti
+ t-Private Information Retrieval Schemes Using Transitive Codes 2017 Ragnar Freij-Hollanti
Oliver W. Gnilke
Camilla Hollanti
Anna-Lena Trautmann
David Karpuk
Ivo Kubjas
+ PDF Chat Well-rounded lattices for coset coding in MIMO wiretap channels 2016 Oliver W. Gnilke
Amaro Barreal
Alex Karrila
Ha Thanh Nguyen Tran
David Karpuk
Camilla Hollanti
+ PDF Chat Information bounds and flatness factor approximation for fading wiretap MIMO channels 2016 Amaro Barreal
Alex Karrila
David Karpuk
Camilla Hollanti
+ On Analytical and Geometric Lattice Design Criteria for Wiretap Coset Codes. 2016 Alex Karrila
David Karpuk
Camilla Hollanti
+ Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels 2016 Mohamed Taoufiq Damir
Alex Karrila
Laia AmorĂłs
Oliver W. Gnilke
David Karpuk
Camilla Hollanti
+ Well-Rounded Lattices for Coset Coding in MIMO Wiretap Channels 2016 Oliver W. Gnilke
Amaro Barreal
Alex Karrila
Ha Thanh Nguyen Tran
David Karpuk
Camilla Hollanti
+ PDF Chat Well-rounded lattices for reliability and security in Rayleigh fading SISO channels 2016 Oliver W. Gnilke
Ha Thanh Nguyen Tran
Alex Karrila
Camilla Hollanti
+ PDF Chat On the Combinatorics of Locally Repairable Codes via Matroid Theory 2016 Thomas WesterbÀck
Ragnar Freij-Hollanti
Toni Ernvall
Camilla Hollanti
+ Density of Spherically-Embedded Stiefel and Grassmann Codes 2016 Renaud-Alexandre Pitaval
Lu Wei
Olav Tirkkonen
Camilla Hollanti
+ PDF Chat A connection between locally repairable codes and exact regenerating codes 2016 Toni Ernvall
Thomas WesterbÀck
Ragnar Freij-Hollanti
Camilla Hollanti
+ PDF Chat Bounds on the maximal minimum distance of linear locally repairable codes 2016 Antti PöllÀnen
Thomas WesterbÀck
Ragnar Freij-Hollanti
Camilla Hollanti
+ Information Bounds and Flatness Factor Approximation for Fading Wiretap MIMO Channels 2016 Amaro Barreal
Alex Karrila
David Karpuk
Camilla Hollanti
+ Coded Caching Clusters with Device-to-Device Communications 2016 Joonas PÀÀkkönen
Amaro Barreal
Camilla Hollanti
Olav Tirkkonen
+ Well-Rounded Lattices for Reliability and Security in Rayleigh Fading SISO Channels 2016 Oliver W. Gnilke
Ha Thanh Nguyen Tran
Alex Karrila
Camilla Hollanti
+ Nested Lattice Codes for Vector Perturbation Systems 2016 David Karpuk
Amaro Barreal
Oliver W. Gnilke
Camilla Hollanti
+ PDF Chat Locally Diverse Constellations From the Special Orthogonal Group 2016 David Karpuk
Camilla Hollanti
+ Improved Singleton-type Bounds for Locally Repairable Codes 2016 Antti PöllÀnen
Thomas WesterbÀck
Ragnar Freij-Hollanti
Camilla Hollanti
+ Bounds on the Maximal Minimum Distance of Linear Locally Repairable Codes 2016 Antti PöllÀnen
Thomas WesterbÀck
Ragnar Freij-Hollanti
Camilla Hollanti
+ Theta Series Approximation with Applications to Compute-and-Forward Relaying 2016 Amaro Barreal
David Karpuk
Camilla Hollanti
+ An Approximation of Theta Functions with Applications to Communications 2016 Amaro Barreal
Mohamed Taoufiq Damir
Ragnar Freij-Hollanti
Camilla Hollanti
+ CONDENSE: A Reconfigurable Knowledge Acquisition Architecture for Future 5G IoT 2016 Dejan Vukobratović
Duơan Jakovetić
Vitaly Skachek
Dragana Bajović
Dino Sejdinović
GĂŒneƟ Karabulut Kurt
Camilla Hollanti
Ingo Fischer
+ Nested Lattice Codes for Vector Perturbation Systems 2016 David Karpuk
Amaro Barreal
Oliver W. Gnilke
Camilla Hollanti
+ Coded Caching Clusters with Device-to-Device Communications 2016 Joonas PÀÀkkönen
Amaro Barreal
Camilla Hollanti
Olav Tirkkonen
+ An Approximation of Theta Functions with Applications to Communications 2016 Amaro Barreal
Mohamed Taoufiq Damir
Ragnar Freij-Hollanti
Camilla Hollanti
+ Well-Rounded Lattices for Reliability and Security in Rayleigh Fading SISO Channels 2016 Oliver W. Gnilke
Ha Thanh Nguyen Tran
Alex Karrila
Camilla Hollanti
+ Bounds on the Maximal Minimum Distance of Linear Locally Repairable Codes 2016 Antti PöllÀnen
Thomas WesterbÀck
Ragnar Freij-Hollanti
Camilla Hollanti
+ Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels 2016 Mohamed Taoufiq Damir
Alex Karrila
Laia AmorĂłs
Oliver W. Gnilke
David Karpuk
Camilla Hollanti
+ Density of Spherically-Embedded Stiefel and Grassmann Codes 2016 Renaud-Alexandre Pitaval
Wei Lu
Olav Tirkkonen
Camilla Hollanti
+ PDF Chat Constructions and Properties of Linear Locally Repairable Codes 2015 Toni Ernvall
Thomas WesterbÀck
Ragnar Freij-Hollanti
Camilla Hollanti
+ Probability estimates for fading and wiretap channels from ideal class zeta functions 2015 David Karpuk
Anne-Maria Ernvall-Hytönen
Camilla Hollanti
Emanuele Viterbo
+ PDF Chat Fast-Decodable Space–Time Codes for the -Relay and Multiple-Access MIMO Channel 2015 Amaro Barreal
Camilla Hollanti
Nadya Markin
+ Applications of Polymatroid Theory to Distributed Storage Systems 2015 Thomas WesterbÀck
Ragnar Freij-Hollanti
Camilla Hollanti
+ PDF Chat A low-complexity message recovery method for Compute-and-Forward relaying 2015 Amaro Barreal
Joonas PÀÀkkönen
David Karpuk
Camilla Hollanti
Olav Tirkkonen
+ PDF Chat Applications of polymatroid theory to distributed storage systems 2015 Thomas WesterbÀck
Ragnar Freij-Hollanti
Camilla Hollanti
+ Locally Diverse Constellations from the Special Orthogonal Group 2015 David Karpuk
Camilla Hollanti
+ PDF Chat Locally Diverse Constellations from the Special Orthogonal Group 2015 David Karpuk
Camilla Hollanti
+ Constructions of Fast-Decodable Distributed Space-Time Codes 2015 Amaro Barreal
Camilla Hollanti
Nadya Markin
+ A Low-Complexity Message Recovery Method for Compute-and-Forward Relaying 2015 Amaro Barreal
Joonas PÀÀkkönen
David Karpuk
Camilla Hollanti
Olav Tirkkonen
+ PDF Chat A comparison of skewed and orthogonal lattices in Gaussian wiretap channels 2015 Alex Karrila
Camilla Hollanti
+ PDF Chat Constructions of Fast-Decodable Distributed Space-Time Codes 2015 Amaro Barreal
Camilla Hollanti
Nadya Markin
+ Reduced Complexity Decoding of n x n Algebraic Space-Time Codes 2015 Amaro Barreal
Camilla Hollanti
David Karpuk
+ PDF Chat Device-to-Device Data Storage with Regenerating Codes 2015 Joonas PÀÀkkönen
Camilla Hollanti
Olav Tirkkonen
+ Locally Diverse Constellations from the Special Orthogonal Group 2015 David Karpuk
Camilla Hollanti
+ Constructions of Fast-Decodable Distributed Space-Time Codes 2015 Amaro Barreal
Camilla Hollanti
Nadya Markin
+ On the Combinatorics of Locally Repairable Codes via Matroid Theory 2015 Thomas WesterbÀck
Ragnar Freij-Hollanti
Toni Ernvall
Camilla Hollanti
+ A Low-Complexity Message Recovery Method for Compute-and-Forward Relaying 2015 Amaro Barreal
Joonas PÀÀkkönen
David Karpuk
Camilla Hollanti
Olav Tirkkonen
+ Applications of Polymatroid Theory to Distributed Storage Systems 2015 Thomas WesterbÀck
Ragnar Freij-Hollanti
Camilla Hollanti
+ On the Combinatorics of Locally Repairable Codes via Matroid Theory 2014 Thomas WesterbÀck
Ragnar Freij-Hollanti
Toni Ernvall
Camilla Hollanti
+ A Comparison of Skewed and Orthogonal Lattices in Gaussian Wiretap Channels 2014 Alex Karrila
Camilla Hollanti
+ Device-to-Device Data Storage with Regenerating Codes 2014 Joonas PÀÀkkönen
Camilla Hollanti
Olav Tirkkonen
+ PDF Chat Multi-dimensional and non-uniform constellation optimization via the special orthogonal group 2014 David Karpuk
Camilla Hollanti
+ PDF Chat Strong secrecy in wireless network coding systems with M-QAM modulators 2014 Arsenia Chorti
Mehdi M. Molu
David Karpuk
Camilla Hollanti
Alister G. Burr
+ Node Repair for Distributed Storage Systems over Fading Channels 2014 David Karpuk
Camilla Hollanti
Amaro Barreal
+ Multi-Dimensional and Non-Uniform Constellation Optimization via the Special Orthogonal Group 2014 David Karpuk
Camilla Hollanti
+ PDF Chat Nonuniform Fuchsian codes for noisy channels 2014 IvĂĄn Blanco-ChacĂłn
DionĂ­s RemĂłn
Camilla Hollanti
Montserrat Alsina
+ PDF Chat Rotating non-uniform and high-dimensional constellations using geodesic flow on lie groups 2014 David Karpuk
Camilla Hollanti
+ PDF Chat Space-time storage codes for wireless distributed storage systems 2014 Camilla Hollanti
David Karpuk
Amaro Barreal
Hsiao-feng Lu
+ PDF Chat Constructions of optimal and almost optimal locally repairable codes 2014 Toni Ernvall
Thomas WesterbÀck
Camilla Hollanti
+ Space-Time Storage Codes for Wireless Distributed Storage Systems 2014 Camilla Hollanti
David Karpuk
Amaro Barreal
Hsiao-feng Lu
+ Linear Locally Repairable Codes with Random Matrices 2014 Toni Ernvall
Thomas WesterbÀck
Camilla Hollanti
+ Algebraic Codes and a New Physical Layer Transmission Protocol for Wireless Distributed Storage Systems 2014 Amaro Barreal
Camilla Hollanti
David Karpuk
Hsiao-feng Lu
+ Fuchsian codes with arbitrarily high code rate 2014 IvĂĄn Blanco-ChacĂłn
Camilla Hollanti
Montserrat Alsina
DionĂ­s RemĂłn
+ Node Repair for Distributed Storage Systems over Fading Channels 2014 David Karpuk
Camilla Hollanti
Amaro Barreal
+ A Comparison of Skewed and Orthogonal Lattices in Gaussian Wiretap Channels 2014 Alex Karrila
Camilla Hollanti
+ Space-Time Storage Codes for Wireless Distributed Storage Systems 2014 Camilla Hollanti
David Karpuk
Amaro Barreal
Hsiao-feng Lu
+ Device-to-Device Data Storage with Regenerating Codes 2014 Joonas PÀÀkkönen
Camilla Hollanti
Olav Tirkkonen
+ Probability Estimates for Fading and Wiretap Channels from Ideal Class Zeta Functions 2014 David Karpuk
Anne-Maria Ernvall-Hytönen
Camilla Hollanti
Emanuele Viterbo
+ Multi-Dimensional and Non-Uniform Constellation Optimization via the Special Orthogonal Group 2014 David Karpuk
Camilla Hollanti
+ PDF Chat Device-to-device data storage for mobile cellular systems 2013 Joonas PÀÀkkönen
Camilla Hollanti
Olav Tirkkonen
+ PDF Chat Capacity and Security of Heterogeneous Distributed Storage Systems 2013 Toni Ernvall
Salim El Rouayheb
Camilla Hollanti
H. Vincent Poor
+ Rotating Non-Uniform and High-Dimensional Constellations Using Geodesic Flow on Lie Groups 2013 David Karpuk
Camilla Hollanti
+ PDF Chat Capacity and security of heterogeneous distributed storage systems 2013 Toni Ernvall
Salini El Rouayheb
Camilla Hollanti
H. Vincent Poor
+ Nonasymptotic Probability Bounds for Fading Channels Exploiting Dedekind Zeta Functions 2013 Camilla Hollanti
Emanuele Viterbo
David Karpuk
+ Fuchsian codes for AWGN channels 2013 IvĂĄn Blanco-ChacĂłn
DionĂ­s RemĂłn
Camilla Hollanti
Montserrat Alsina
+ Device-to-Device Data Storage for Mobile Cellular Systems 2013 Joonas PÀÀkkönen
Camilla Hollanti
Olav Tirkkonen
+ Nonasymptotic Probability Bounds for Fading Channels Exploiting Dedekind Zeta Functions 2013 Camilla Hollanti
Emanuele Viterbo
David Karpuk
+ Rotating Non-Uniform and High-Dimensional Constellations Using Geodesic Flow on Lie Groups 2013 David Karpuk
Camilla Hollanti
+ PDF Chat Algebraic fast-decodable relay codes for distributed communications 2012 Camilla Hollanti
Nadya Markin
+ Algebraic Fast-Decodable Relay Codes for Distributed Communications 2012 Camilla Hollanti
Nadya Markin
+ Algebraic Fast-Decodable Relay Codes for Distributed Communications 2012 Camilla Hollanti
Nadya Markin
+ PDF Chat Fast-Decodable Asymmetric Space-Time Codes From Division Algebras 2011 Roope Vehkalahti
Camilla Hollanti
Frédérique Oggier
+ PDF Chat On the eavesdropper's correct decision in Gaussian and fading wiretap channels using lattice codes 2011 Anne-Maria Ernvall-Hytönen
Camilla Hollanti
+ PDF Chat Algebraic hybrid satellite-terrestrial space-time codes for digital broadcasting in SFN 2011 Camilla Hollanti
Roope Vehkalahti
Youssef Nasser
+ On the Eavesdropper's Correct Decision in Gaussian and Fading Wiretap Channels Using Lattice Codes 2011 Anne-Maria Ernvall-Hytönen
Camilla Hollanti
+ On the Eavesdropper's Correct Decision in Gaussian and Fading Wiretap Channels Using Lattice Codes 2011 Anne-Maria Ernvall-Hytönen
Camilla Hollanti
+ PDF Chat Remarks on the criteria of constructing MIMO-MAC DMT optimal codes 2010 Hsiao-feng Lu
Jyrki Lahtonen
Roope Vehkalahti
Camilla Hollanti
+ PDF Chat On the decay of the determinants of multiuser MIMO lattice codes 2010 Jyrki Lahtonen
Roope Vehkalahti
Hsiao-feng Lu
Camilla Hollanti
Emanuele Viterbo
+ PDF Chat On the Densest MIMO Lattices From Cyclic Division Algebras 2009 Roope Vehkalahti
Camilla Hollanti
Jyrki Lahtonen
Kalle Ranto
+ On the Decay of the Determinants of Multiuser MIMO Lattice Codes 2009 Jyrki Lahtonen
Roope Vehkalahti
Hsiao-feng Lu
Camilla Hollanti
Emanuele Viterbo
+ Remarks on the Criteria of Constructing MIMO-MAC DMT Optimal Codes 2009 Hsiao-feng
LĂŒ
Jyrki Lahtonen
Roope Vehkalahti
Camilla Hollanti
+ PDF Chat Maximal Orders in the Design of Dense Space-Time Lattice Codes 2008 Camilla Hollanti
Jyrki Lahtonen
Hsiao-feng Lu
+ On the densest MIMO lattices from cyclic division algebras 2007 Camilla Hollanti
Jyrki Lahtonen
Kalle Ranto
Roope Vehkalahti
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ The Capacity of Private Information Retrieval From Coded Databases 2018 Karim Banawan
ƞennur UlukuƟ
26
+ Private Information Retrieval From MDS Coded Data in Distributed Storage Systems 2018 Razane Tajeddine
Oliver W. Gnilke
Salim El Rouayheb
25
+ The Capacity of Private Information Retrieval 2017 Hua Sun
Syed A. Jafar
25
+ PDF Chat Private Information Retrieval from Coded Databases with Colluding Servers 2017 Ragnar Freij-Hollanti
Oliver W. Gnilke
Camilla Hollanti
David Karpuk
24
+ PDF Chat Network Coding for Distributed Storage Systems 2010 Alexandros G. Dimakis
P. Brighten Godfrey
Yunnan Wu
Martin J. Wainwright
Kannan Ramchandran
24
+ The Capacity of Robust Private Information Retrieval With Colluding Databases 2017 Hua Sun
Syed A. Jafar
21
+ PDF Chat On the Locality of Codeword Symbols 2012 Parikshit Gopalan
Cheng Huang
Huseyin Simitci
Sergey Yekhanin
19
+ PDF Chat A Family of Optimal Locally Recoverable Codes 2014 Itzhak Tamo
Alexander Barg
16
+ The Capacity of Private Information Retrieval from Byzantine and Colluding Databases 2018 Karim Banawan
ƞennur UlukuƟ
14
+ PDF Chat Lattice Codes for the Wiretap Gaussian Channel: Construction and Analysis 2015 Frédérique Oggier
Patrick Solé
Jean-Claude Belfiore
14
+ PDF Chat Lattice Code Design for the Rayleigh Fading Wiretap Channel 2011 Jean-Claude Belfiore
Frédérique Oggier
14
+ PDF Chat Secure symmetric private information retrieval from colluding databases with adversaries 2017 Qiwen Wang
Mikael Skoglund
13
+ PDF Chat $t$-private information retrieval schemes using transitive codes 2018 Ragnar Freij-Hollanti
Oliver W. Gnilke
Camilla Hollanti
Anna-Lena Trautmann
David Karpuk
Ivo Kubjas
13
+ PDF Chat Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction 2011 K. V. Rashmi
Nihar B. Shah
P. Vijay Kumar
12
+ PDF Chat Locally repairable codes 2012 Dimitris Papailiopoulos
Alexandros G. Dimakis
12
+ PDF Chat On the Combinatorics of Locally Repairable Codes via Matroid Theory 2016 Thomas WesterbÀck
Ragnar Freij-Hollanti
Toni Ernvall
Camilla Hollanti
11
+ PDF Chat Semantically Secure Lattice Codes for the Gaussian Wiretap Channel 2014 Cong Ling
Laura Luzzi
Jean-Claude Belfiore
Damien Stehlé
11
+ The Capacity of Symmetric Private Information Retrieval 2018 Hua Sun
Syed A. Jafar
10
+ PDF Chat Optimal linear codes with a local-error-correction property 2012 N. Prakash
Govinda M. Kamath
V. Lalitha
P. Vijay Kumar
10
+ PDF Chat Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes 2019 Siddhartha Kumar
Hsuan-Yin Lin
Eirik Rosnes
Alexandre Graell i Amat
10
+ Towards the Capacity of Private Information Retrieval from Coded and Colluding Servers 2019 Lukas Holzbaur
Ragnar Freij-Hollanti
Jie Li
Camilla Hollanti
9
+ PDF Chat Almost universal codes for fading wiretap channels 2016 Laura Luzzi
Cong Ling
Roope Vehkalahti
9
+ PDF Chat An upper bound on the size of locally recoverable codes 2013 Viveck R. Cadambe
Arya Mazumdar
9
+ PDF Chat Symmetric private information retrieval for MDS coded distributed storage 2017 Qiwen Wang
Mikael Skoglund
8
+ GASP Codes for Secure Distributed Matrix Multiplication 2020 Rafael G. L. D’Oliveira
Salim El Rouayheb
David Karpuk
8
+ PDF Chat On the Densest MIMO Lattices From Cyclic Division Algebras 2009 Roope Vehkalahti
Camilla Hollanti
Jyrki Lahtonen
Kalle Ranto
8
+ PDF Chat Optimal Locally Repairable and Secure Codes for Distributed Storage Systems 2014 Ankit Singh Rawat
O. Ozan Koyluoglu
Natalia Silberstein
Sriram Vishwanath
8
+ PDF Chat Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers 2019 Razane Tajeddine
Oliver W. Gnilke
David Karpuk
Ragnar Freij-Hollanti
Camilla Hollanti
8
+ PDF Chat 2-Server PIR with Sub-Polynomial Communication 2015 Zeev Dvir
Sivakanth Gopi
8
+ PDF Chat Optimal locally repairable codes and connections to matroid theory 2013 Itzhak Tamo
Dimitris Papailiopoulos
Alexandros G. Dimakis
8
+ Capacity-Achieving Private Information Retrieval Codes From MDS-Coded Databases With Minimum Message Size 2020 Ruida Zhou
Chao Tian
Hua Sun
Tie Liu
8
+ PDF Chat Inverse Determinant Sums and Connections Between Fading Channel Information Theory and Algebra 2013 Roope Vehkalahti
Hsiao-feng Lu
Laura Luzzi
8
+ PDF Chat Cyclic Division Algebras: A Tool for Space-Time Coding 2007 Frédérique Oggier
Jean‐Claude Belfiore
Emanuele Viterbo
7
+ PDF Chat On the Capacity of Secure Distributed Matrix Multiplication 2018 Wei-Ting Chang
Ravi Tandon
7
+ PDF Chat Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the "Cubic" Barrier 2020 Qian Yu
A. Salman Avestimehr
7
+ Probability estimates for fading and wiretap channels from ideal class zeta functions 2015 David Karpuk
Anne-Maria Ernvall-Hytönen
Camilla Hollanti
Emanuele Viterbo
7
+ PDF Chat Well-rounded lattices for reliability and security in Rayleigh fading SISO channels 2016 Oliver W. Gnilke
Ha Thanh Nguyen Tran
Alex Karrila
Camilla Hollanti
7
+ PDF Chat Capacity of Quantum Private Information Retrieval With Multiple Servers 2020 Seunghoan Song
Masahito Hayashi
7
+ PDF Chat Fast-Decodable Asymmetric Space-Time Codes From Division Algebras 2011 Roope Vehkalahti
Camilla Hollanti
Frédérique Oggier
7
+ PDF Chat Maximal Orders in the Design of Dense Space-Time Lattice Codes 2008 Camilla Hollanti
Jyrki Lahtonen
Hsiao-feng Lu
7
+ PDF Chat Optimal Locally Repairable Linear Codes 2014 Wentu Song
Son Hoang Dau
Chau Yuen
Tiffany Jing Li
7
+ PDF Chat Critical Pairs for the Product Singleton Bound 2015 Diego Mirandola
Gilles ZĂ©mor
7
+ PDF Chat Compute-and-Forward: Harnessing Interference Through Structured Codes 2011 Bobak Nazer
Michael Gastpar
7
+ PDF Chat Private information retrieval in distributed storage systems using an arbitrary linear code 2017 Siddhartha Kumar
Eirik Rosnes
Alexandre Graell i Amat
7
+ PDF Chat Private information retrieval schemes for coded data with arbitrary collusion patterns 2017 Razane Tajeddine
Oliver W. Gnilke
David Karpuk
Ragnar Freij-Hollanti
Camilla Hollanti
Salim El Rouayheb
7
+ PDF Chat A New Capacity-Achieving Private Information Retrieval Scheme With (Almost) Optimal File Length for Coded Servers 2019 Jinbao Zhu
Qifa Yan
Chao Qi
Xiaohu Tang
7
+ Private and Secure Distributed Matrix Multiplication With Flexible Communication Load 2020 Malihe Aliasgari
Osvaldo Simeone
Jörg Kliewer
7
+ PDF Chat Locally Diverse Constellations From the Special Orthogonal Group 2016 David Karpuk
Camilla Hollanti
6
+ PDF Chat Quantum Private Information Retrieval with Sublinear Communication Complexity 2012 François Le Gall
6
+ PDF Chat Private information retrieval from MDS coded data in distributed storage systems 2016 Razane Tajeddine
Salim El Rouayheb
6