Camilla Hollanti

From MaRDI portal
(Redirected from Camilla Hollanti)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Euclidean lattices: theory and applications
(available as arXiv preprint)
N/APaper
Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack
(available as arXiv preprint)
N/APaper
Fast multiplication and the PLWE-RLWE equivalence for an infinite family of maximal real subfields of cyclotomic fields
Designs, Codes and Cryptography
2025-09-04Paper
Algebraic geometry codes for secure distributed matrix multiplication
IEEE Transactions on Information Theory
2025-07-11Paper
Dense generic well-rounded lattices
SIAM Journal on Applied Algebra and Geometry
2025-03-07Paper
N-sum box: an abstraction for linear computation over many-to-one quantum networks
IEEE Transactions on Information Theory
2025-02-27Paper
Euclidean lattices: theory and applications
Communications in Mathematics
2024-08-28Paper
General framework for linear secure distributed matrix multiplication with Byzantine servers
IEEE Transactions on Information Theory
2024-07-23Paper
Fast Multiplication and the PLWE-RLWE Equivalence for an Infinite Family of Cyclotomic Subextensions
(available as arXiv preprint)
2024-01-01Paper
Toward the Capacity of Private Information Retrieval From Coded and Colluding Servers
IEEE Transactions on Information Theory
2022-02-17Paper
Even Unimodular Lattices from Quaternion Algebras2021-09-21Paper
Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels
IEEE Transactions on Information Theory
2021-07-23Paper
Dense generic well-rounded lattices2021-07-02Paper
Cyclic flats of binary matroids
Advances in Applied Mathematics
2021-04-23Paper
On fast-decodable algebraic space-time codes
(available as arXiv preprint)
2021-03-22Paper
The complete hierarchical locality of the punctured simplex code
Designs, Codes and Cryptography
2021-01-25Paper
An Approximation of Theta Functions with Applications to Communications
SIAM Journal on Applied Algebra and Geometry
2021-01-08Paper
Even Unimodular Lattices from Quaternion Algebras
(available as arXiv preprint)
2021-01-01Paper
Private Streaming With Convolutional Codes
IEEE Transactions on Information Theory
2020-09-29Paper
Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes
IEEE Transactions on Information Theory
2020-01-28Paper
$t$-private information retrieval schemes using transitive codes
IEEE Transactions on Information Theory
2019-07-19Paper
Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers
IEEE Transactions on Information Theory
2019-07-19Paper
Improved user-private information retrieval via finite geometry
Designs, Codes and Cryptography
2019-02-20Paper
Natural orders for asymmetric space-time coding: minimizing the discriminant
Applicable Algebra in Engineering, Communication and Computing
2018-11-15Paper
Density of Spherically Embedded Stiefel and Grassmann Codes
IEEE Transactions on Information Theory
2018-06-27Paper
On binary matroid minors and applications to data storage over small fields
(available as arXiv preprint)
2018-03-16Paper
Private information retrieval from coded databases with colluding servers
SIAM Journal on Applied Algebra and Geometry
2018-02-14Paper
Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures2017-09-18Paper
Construction Methods for Asymmetric and Multiblock Space–Time Codes
IEEE Transactions on Information Theory
2017-08-08Paper
On the Densest MIMO Lattices From Cyclic Division Algebras
IEEE Transactions on Information Theory
2017-08-08Paper
Optimal Diversity–Multiplexing Tradeoff and Code Constructions of Some Constrained Asymmetric MIMO Systems
IEEE Transactions on Information Theory
2017-07-27Paper
Fast-Decodable Asymmetric Space-Time Codes From Division Algebras
IEEE Transactions on Information Theory
2017-07-12Paper
DMT Optimal Codes Constructions for Multiple-Access MIMO Channel
IEEE Transactions on Information Theory
2017-07-12Paper
On the Combinatorics of Locally Repairable Codes via Matroid Theory
IEEE Transactions on Information Theory
2017-04-28Paper
Constructions and Properties of Linear Locally Repairable Codes
IEEE Transactions on Information Theory
2017-04-28Paper
Matroid Theory and Storage Codes: Bounds and Constructions2017-04-13Paper
Matroid Theory and Storage Codes: Bounds and Constructions
(available as arXiv preprint)
2017-01-01Paper
Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures
(available as arXiv preprint)
2017-01-01Paper
Bounds on the Maximal Minimum Distance of Linear Locally Repairable Codes2016-02-14Paper
Constructions of fast-decodable distributed space-time codes
Coding Theory and Applications
2016-01-07Paper
Bounds on the Maximal Minimum Distance of Linear Locally Repairable Codes
(available as arXiv preprint)
2016-01-01Paper
Probability estimates for fading and wiretap channels from ideal class zeta functions
Advances in Mathematics of Communications
2015-11-25Paper
Fuchsian codes with arbitrarily high code rates
Journal of Pure and Applied Algebra
2015-10-27Paper
Fuchsian codes with arbitrarily high code rates
Journal of Pure and Applied Algebra
2015-10-27Paper
Nonuniform Fuchsian codes for noisy channels
Journal of the Franklin Institute
2015-03-19Paper
Fast-Decodable Space-Time Codes for the N-Relay and Multiple-Access MIMO Channel2014-12-03Paper
Algebraic Codes and a New Physical Layer Transmission Protocol for Wireless Distributed Storage Systems2014-05-17Paper
Algebraic Codes and a New Physical Layer Transmission Protocol for Wireless Distributed Storage Systems
(available as arXiv preprint)
2014-01-01Paper
Fast-Decodable Space-Time Codes for the $N$-Relay and Multiple-Access MIMO Channel
(available as arXiv preprint)
2014-01-01Paper
Nonasymptotic Probability Bounds for Fading Channels Exploiting Dedekind Zeta Functions2013-03-14Paper
Nonasymptotic Probability Bounds for Fading Channels Exploiting Dedekind Zeta Functions
(available as arXiv preprint)
2013-01-01Paper
Time, space and algebras in information transfer
Arkhimedes
2012-06-09Paper
Algebraic Fast-Decodable Relay Codes for Distributed Communications2012-02-27Paper
Algebraic Fast-Decodable Relay Codes for Distributed Communications
(available as arXiv preprint)
2012-01-01Paper
Cyclic division algebras in space-time coding: a brief overview
European Women in Mathematics
2010-06-17Paper
Maximal Orders in the Design of Dense Space-Time Lattice Codes
IEEE Transactions on Information Theory
2009-02-24Paper
Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
2008-04-17Paper


Research outcomes over time


This page was built for person: Camilla Hollanti