Camilla Hollanti

According to our database1, Camilla Hollanti authored at least 106 papers between 2004 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2021
Private Information Retrieval Schemes With Product-Matrix MBR Codes.
IEEE Trans. Inf. Forensics Secur., 2021

2020
Private Streaming With Convolutional Codes.
IEEE Trans. Inf. Theory, 2020

Private Information Retrieval Over Random Linear Networks.
IEEE Trans. Inf. Forensics Secur., 2020

Towards Practical Private Information Retrieval From MDS Array Codes.
IEEE Trans. Commun., 2020

Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Computational Code-Based Single-Server Private Information Retrieval.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Quantum Private Information Retrieval from MDS-coded and Colluding Servers.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Coded Caching Clusters with Device-to-Device Communications.
IEEE Trans. Mob. Comput., 2019

Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers.
IEEE Trans. Inf. Theory, 2019

Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes.
IEEE Trans. Inf. Theory, 2019

$t$ -Private Information Retrieval Schemes Using Transitive Codes.
IEEE Trans. Inf. Theory, 2019

Uniform Minors in Maximally Recoverable Codes.
IEEE Commun. Lett., 2019

Improved user-private information retrieval via finite geometry.
Des. Codes Cryptogr., 2019

Private Information Retrieval from MDS Array Codes with (Near-) Optimal Repair Bandwidth.
CoRR, 2019

File Size Distributions and Caching for Offloading.
Proceedings of the 20th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2019

On the Capacity of Private Information Retrieval from Coded, Colluding, and Adversarial Servers.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

The Complete Hierarchical Locality of the Punctured Simplex Code.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Density of Spherically Embedded Stiefel and Grassmann Codes.
IEEE Trans. Inf. Theory, 2018

Preface to the special issue on network coding and designs.
Des. Codes Cryptogr., 2018

Private Information Retrieval Schemes with Regenerating Codes.
CoRR, 2018

Private Information Retrieval over Networks.
CoRR, 2018

Natural orders for asymmetric space-time coding: minimizing the discriminant.
Appl. Algebra Eng. Commun. Comput., 2018

Analysis of Some Well-Rounded Lattices in Wiretap Channels.
Proceedings of the 19th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2018

Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Private Information Retrieval from Coded Databases with Colluding Servers.
SIAM J. Appl. Algebra Geom., 2017

Special issue on network coding.
EURASIP J. Adv. Signal Process., 2017

On Fast-Decodable Algebraic Space-Time Codes.
CoRR, 2017

Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures.
CoRR, 2017

Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns.
CoRR, 2017

Traffic Minimizing Caching and Latent Variable Distributions of Order Statistics.
CoRR, 2017

Matroid Theory and Storage Codes: Bounds and Constructions.
CoRR, 2017

Private information retrieval schemes for codec data with arbitrary collusion patterns.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Lattice coding for Rician fading channels from Hadamard rotations.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

On Binary Matroid Minors and Applications to Data Storage over Small Fields.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

2016
Locally Diverse Constellations From the Special Orthogonal Group.
IEEE Trans. Wirel. Commun., 2016

Fast-Decodable Space-Time Codes for the N-Relay and Multiple-Access MIMO Channel.
IEEE Trans. Wirel. Commun., 2016

On the Combinatorics of Locally Repairable Codes via Matroid Theory.
IEEE Trans. Inf. Theory, 2016

Constructions and Properties of Linear Locally Repairable Codes.
IEEE Trans. Inf. Theory, 2016

Efficiently sphere-decodable physical layer transmission schemes for wireless storage networks.
EURASIP J. Adv. Signal Process., 2016

Improved Singleton-type Bounds for Locally Repairable Codes.
CoRR, 2016

On Analytical and Geometric Lattice Design Criteria for Wiretap Coset Codes.
CoRR, 2016

Information Bounds and Flatness Factor Approximation for Fading Wiretap Channels.
CoRR, 2016

Nested Lattice Codes for Vector Perturbation Systems.
CoRR, 2016

Decoding in Compute-and-Forward Relaying: Real Lattices and the Flatness of Lattice Sums.
CoRR, 2016

CONDENSE: A Reconfigurable Knowledge Acquisition Architecture for Future 5G IoT.
IEEE Access, 2016

Well-rounded lattices for reliability and security in Rayleigh fading SISO channels.
Proceedings of the 2016 IEEE Information Theory Workshop, 2016

Well-rounded lattices for coset coding in MIMO wiretap channels.
Proceedings of the 26th International Telecommunication Networks and Applications Conference, 2016

Information bounds and flatness factor approximation for fading wiretap MIMO channels.
Proceedings of the 26th International Telecommunication Networks and Applications Conference, 2016

Bounds on the maximal minimum distance of linear locally repairable codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

A connection between locally repairable codes and exact regenerating codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Reduced Complexity Decoding of n x n Algebraic Space-Time Codes.
CoRR, 2015

Probability estimates for fading and wiretap channels from ideal class zeta functions.
Adv. Math. Commun., 2015

Device-to-Device Data Storage with Regenerating Codes.
Proceedings of the Multiple Access Communications - 8th International Workshop, 2015

A comparison of skewed and orthogonal lattices in Gaussian wiretap channels.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

A low-complexity message recovery method for Compute-and-Forward relaying.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Applications of polymatroid theory to distributed storage systems.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
Nonuniform Fuchsian codes for noisy channels.
J. Frankl. Inst., 2014

Linear Locally Repairable Codes with Random Matrices.
CoRR, 2014

Fuchsian codes with arbitrarily high code rate.
CoRR, 2014

Algebraic Codes and a New Physical Layer Transmission Protocol for Wireless Distributed Storage Systems.
CoRR, 2014

Space-time storage codes for wireless distributed storage systems.
Proceedings of the 4th International Conference on Wireless Communications, 2014

Constructions of optimal and almost optimal locally repairable codes.
Proceedings of the 4th International Conference on Wireless Communications, 2014

Almost affine locally repairable codes and matroid theory.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Multi-dimensional and non-uniform constellation optimization via the special orthogonal group.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Node repair for distributed storage systems over fading channels.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

New relay-based transmission protocols for wireless distributed storage systems.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Secrecy capacity of heterogeneous distributed storage systems.
Proceedings of the 6th International Symposium on Communications, 2014

Constructions of Fast-Decodable Distributed Space-Time Codes.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

Strong secrecy in wireless network coding systems with M-QAM modulators.
Proceedings of the 2014 IEEE/CIC International Conference on Communications in China, 2014

Rotating non-uniform and high-dimensional constellations using geodesic flow on lie groups.
Proceedings of the IEEE International Conference on Communications, 2014

2013
Capacity and Security of Heterogeneous Distributed Storage Systems.
IEEE J. Sel. Areas Commun., 2013

Nonasymptotic Probability Bounds for Fading Channels Exploiting Dedekind Zeta Functions
CoRR, 2013

Fuchsian codes for AWGN channels.
CoRR, 2013

Probability bounds for an eavesdropper's correct decision over a MIMO wiretap channel.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Device-to-device data storage for mobile cellular systems.
Proceedings of the Workshops Proceedings of the Global Communications Conference, 2013

2012
Fast-Decodable Asymmetric Space-Time Codes From Division Algebras.
IEEE Trans. Inf. Theory, 2012

Distributed storage for proximity based services.
Proceedings of the 2012 Swedish Communication Technologies Workshop, Swe-CTW 2012, Lund, 2012

Algebraic fast-decodable relay codes for distributed communications.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
DMT Optimal Codes Constructions for Multiple-Access MIMO Channel.
IEEE Trans. Inf. Theory, 2011

Algebraic hybrid satellite-terrestrial space-time codes for digital broadcasting in SFN.
Proceedings of the IEEE Workshop on Signal Processing Systems, 2011

Reducing complexity with less than minimum delay space-time lattice codes.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

On the eavesdropper's correct decision in Gaussian and fading wiretap channels using lattice codes.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

A general framework for constructing fast-decodable asymmetric space-time codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Analysis on wiretap lattice codes and probability bounds from Dedekind zeta functions.
Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011

2010
Optimal diversity-multiplexing tradeoff and code constructions of some constrained asymmetric MIMO systems.
IEEE Trans. Inf. Theory, 2010

Some simple observations on MISO codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

A family of cyclic division algebra based fast-decodable 4×2 space-time block codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

Fast-decodable MIDO codes from crossed product algebras.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
On the densest MIMO lattices from cyclic division algebras.
IEEE Trans. Inf. Theory, 2009

Construction Methods for Asymmetric and Multiblock Space-Time Codes.
IEEE Trans. Inf. Theory, 2009

New Space-Time Code Constructions for Two-User Multiple Access Channels.
IEEE J. Sel. Top. Signal Process., 2009

Remarks on the Criteria of Constructing MIMO-MAC DMT Optimal Codes
CoRR, 2009

On the Decay of the Determinants of Multiuser MIMO Lattice Codes
CoRR, 2009

Diversity-multiplexing tradeoff-optimal code constructions for symmetric MIMO multiple access channels.
Proceedings of the IEEE International Symposium on Information Theory, 2009

An algebraic tool for obtaining conditional non-vanishing determinants.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Maximal Orders in the Design of Dense Space-Time Lattice Codes.
IEEE Trans. Inf. Theory, 2008

On the algebraic structure of the Silver code: A 2 × 2 perfect space-time block code.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

On the construction of DMT-Optimal AST codes with transmit antenna selection.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Constructing asymmetric space-time codes with the Smart Puncturing Method.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Asymmetric Space-Time Block Codes for MIMO Systems.
Proceedings of the IEEE Information Theory Workshop on Information Theory for Wireless Networks, 2007

On MIDO Space-Time Block Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes.
Proceedings of the Applied Algebra, 2007

2006
A New Tool: Constructing STBCs from Maximal Orders in Central Simple Algebras.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Optimal Matrix Lattices for MIMO Codes from Division Algebras.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Dense full-diversity matrix lattices for four transmit antenna MISO channel.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Four antenna space-time lattice constellations from division algebras.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004


  Loading...