Camilla Hollanti

Identifiers

• name variant Camilla Hollanti 0.60 · backfill

Papers (92)

1. Structured lattices and their applications to security math.NT · 2026 · author #2
2. Existence and Constructions of Strict Function-Correcting Codes with Data Protection cs.IT · 2026 · author #4
3. Function-Correcting Codes With Data Protection cs.IT · 2025 · author #4
4. The Star Product of Uniformly Random Codes cs.IT · 2025 · author #3
5. Analog Secure Distributed Matrix Multiplication cs.IT · 2025 · author #2
6. CB-cPIR: Code-Based Computational Private Information Retrieval cs.IR · 2025 · author #1
7. Fast Multiplication and the PLWE-RLWE Equivalence for an Infinite Family of Maximal Real Subfields of Cyclotomic Fields cs.CR · 2024 · author #5
8. Secret Sharing for Secure and Private Information Retrieval: A Construction Using Algebraic Geometry Codes cs.IT · 2024 · author #3
9. Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval cs.IT · 2024 · author #3
10. Approximate Gradient Coding for Privacy-Flexible Federated Learning with Non-IID Data cs.LG · 2024 · author #3
11. Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack cs.IT · 2024 · author #2
12. Euclidean lattices: theory and applications math.NT · 2023 · author #2
13. $N$-Sum Box: An Abstraction for Linear Computation over Many-to-one Quantum Networks cs.IT · 2023 · author #5
14. Algebraic Geometry Codes for Secure Distributed Matrix Multiplication cs.IT · 2023 · author #3
15. Secure Distributed Gram Matrix Multiplication cs.IT · 2022 · author #2
16. General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers cs.IT · 2022 · author #2
17. Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes cs.IT · 2022 · author #4
18. Analog Secure Distributed Matrix Multiplication over Complex Numbers cs.CR · 2022 · author #2
19. Even Unimodular Lattices from Quaternion Algebras math.NT · 2021 · author #3
20. Dense generic well-rounded lattices math.NT · 2021 · author #1
21. On the Capacity of Quantum Private Information Retrieval from MDS-Coded and Colluding Servers cs.IT · 2021 · author #6
22. Private and Secure Distributed Matrix Multiplication Schemes for Replicated or MDS-Coded Servers cs.IT · 2021 · author #2
23. Efficient Recovery of a Shared Secret via Cooperation: Applications to SDMM and PIR cs.IT · 2021 · author #3
24. High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes cs.IT · 2021 · author #4
25. Computational Code-Based Single-Server Private Information Retrieval cs.IT · 2020 · author #2
26. Quantum Private Information Retrieval from Coded and Colluding Servers cs.IT · 2020 · author #4
27. Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power cs.IT · 2020 · author #4
28. Towards Practical Private Information Retrieval from MDS Array Codes cs.IT · 2019 · author #3
29. Cyclic Flats of Binary Matroids math.CO · 2019 · author #3
30. Uniform Minors in Maximally Recoverable Codes cs.IT · 2019 · author #4
31. Towards the Capacity of Private Information Retrieval from Coded and Colluding Servers cs.IT · 2019 · author #4
32. A Generic Transformation for Optimal Node Repair in MDS Array Codes over $\mathbf{F}_2$ cs.IT · 2019 · author #3
33. The Complete Hierarchical Locality of the Punctured Simplex Code cs.IT · 2019 · author #2
34. Private Information Retrieval Schemes with Regenerating Codes cs.IT · 2018 · author #4
35. Private Information Retrieval over Random Linear Networks cs.IT · 2018 · author #3
36. Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes cs.IT · 2018 · author #4
37. Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers cs.IT · 2018 · author #5
38. Private Streaming with Convolutional Codes cs.IT · 2018 · author #4
39. Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers cs.IT · 2018 · author #5
40. t-Private Information Retrieval Schemes Using Transitive Codes cs.IT · 2017 · author #3
41. On Fast-Decodable Algebraic Space--Time Codes cs.IT · 2017 · author #2
42. Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures cs.IT · 2017 · author #5
43. Improved User-Private Information Retrieval via Finite Geometry cs.IT · 2017 · author #3
44. On Binary Matroid Minors and Applications to Data Storage over Small Fields cs.IT · 2017 · author #4
45. Traffic Minimizing Caching and Latent Variable Distributions of Order Statistics cs.NI · 2017 · author #4
46. Matroid Theory and Storage Codes: Bounds and Constructions cs.IT · 2017 · author #2
47. Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns cs.IT · 2017 · author #5
48. Lattice coding for Rician fading channels from Hadamard rotations cs.IT · 2017 · author #4
49. Natural orders for asymmetric space--time coding: minimizing the discriminant math.NT · 2017 · author #3
50. Private Information Retrieval from Coded Databases with Colluding Servers cs.IT · 2016 · author #3
51. Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels cs.IT · 2016 · author #6
52. Well-Rounded Lattices for Coset Coding in MIMO Wiretap Channels cs.IT · 2016 · author #6
53. CONDENSE: A Reconfigurable Knowledge Acquisition Architecture for Future 5G IoT cs.IT · 2016 · author #7
54. Density of Spherically-Embedded Stiefel and Grassmann Codes cs.IT · 2016 · author #4
55. Information Bounds and Flatness Factor Approximation for Fading Wiretap MIMO Channels cs.IT · 2016 · author #4
56. Coded Caching Clusters with Device-to-Device Communications cs.NI · 2016 · author #3
57. Well-Rounded Lattices for Reliability and Security in Rayleigh Fading SISO Channels cs.IT · 2016 · author #4
58. Nested Lattice Codes for Vector Perturbation Systems cs.IT · 2016 · author #4
59. A Connection Between Locally Repairable Codes and Exact Regenerating Codes cs.IT · 2016 · author #4
60. Bounds on the Maximal Minimum Distance of Linear Locally Repairable Codes cs.IT · 2016 · author #4
61. An Approximation of Theta Functions with Applications to Communications cs.IT · 2016 · author #4
62. Applications of Polymatroid Theory to Distributed Storage Systems cs.IT · 2015 · author #3
63. Locally Diverse Constellations from the Special Orthogonal Group cs.IT · 2015 · author #2
64. Constructions of Fast-Decodable Distributed Space-Time Codes cs.IT · 2015 · author #2
65. A Low-Complexity Message Recovery Method for Compute-and-Forward Relaying cs.IT · 2015 · author #4
66. Reduced Complexity Decoding of n x n Algebraic Space-Time Codes cs.IT · 2015 · author #2
67. On the Combinatorics of Locally Repairable Codes via Matroid Theory cs.IT · 2014 · author #4
68. Probability Estimates for Fading and Wiretap Channels from Ideal Class Zeta Functions cs.IT · 2014 · author #3
69. Fast-Decodable Space-Time Codes for the $N$-Relay and Multiple-Access MIMO Channel cs.IT · 2014 · author #2
70. A Comparison of Skewed and Orthogonal Lattices in Gaussian Wiretap Channels cs.IT · 2014 · author #2
71. Device-to-Device Data Storage with Regenerating Codes cs.NI · 2014 · author #2
72. Constructions and Properties of Linear Locally Repairable Codes cs.IT · 2014 · author #3
73. Fuchsian codes with arbitrarily high code rate cs.IT · 2014 · author #2
74. Node Repair for Distributed Storage Systems over Fading Channels cs.IT · 2014 · author #2
75. Multi-Dimensional and Non-Uniform Constellation Optimization via the Special Orthogonal Group cs.IT · 2014 · author #2
76. Linear Locally Repairable Codes with Random Matrices cs.IT · 2014 · author #3
77. Strong Secrecy in Wireless Network Coding Systems with M-QAM Modulators cs.CR · 2014 · author #4
78. Constructions of Optimal and Almost Optimal Locally Repairable Codes cs.IT · 2014 · author #3
79. Algebraic Codes and a New Physical Layer Transmission Protocol for Wireless Distributed Storage Systems cs.IT · 2014 · author #2
80. Space-Time Storage Codes for Wireless Distributed Storage Systems cs.IT · 2014 · author #1
81. Nonuniform Fuchsian codes for noisy channels cs.IT · 2014 · author #3
82. Rotating Non-Uniform and High-Dimensional Constellations Using Geodesic Flow on Lie Groups cs.IT · 2013 · author #2
83. Fuchsian codes for AWGN channels cs.IT · 2013 · author #3
84. Nonasymptotic Probability Bounds for Fading Channels Exploiting Dedekind Zeta Functions cs.IT · 2013 · author #1
85. Capacity and Security of Heterogeneous Distributed Storage Systems cs.DC · 2012 · author #3
86. Algebraic Fast-Decodable Relay Codes for Distributed Communications cs.IT · 2012 · author #1
87. On the Eavesdropper's Correct Decision in Gaussian and Fading Wiretap Channels Using Lattice Codes cs.CR · 2011 · author #2
88. Algebraic Hybrid Satellite-Terrestrial Space-Time Codes for Digital Broadcasting in SFN cs.IT · 2011 · author #1
89. Fast-Decodable Asymmetric Space-Time Codes from Division Algebras cs.IT · 2010 · author #2
90. Remarks on the Criteria of Constructing MIMO-MAC DMT Optimal Codes cs.IT · 2009 · author #4
91. On the Decay of the Determinants of Multiuser MIMO Lattice Codes cs.IT · 2009 · author #4
92. Maximal Orders in the Design of Dense Space-Time Lattice Codes cs.IT · 2008 · author #1

Mentions

• 2508.17479 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2505.03407 #1 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2402.02871 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2410.00792 #5 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2107.00958 #1 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2408.00542 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2405.18052 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2404.03524 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2307.08137 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2205.07052 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2304.07561 #5 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2303.15429 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2211.14213 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2202.03352 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2202.09095 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2106.11214 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2106.05785 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2106.14719 #6 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1901.06067 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1903.12552 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2109.09993 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2102.02511 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2001.05883 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1609.07723 #6 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1601.05596 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2001.04800 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2001.07049 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1909.10289 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1806.00239 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1901.03149 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1906.10936 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1810.08941 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1906.02423 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1810.08510 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1811.02898 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1806.08006 #5 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1802.03731 #5 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1611.02062 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1709.05801 #5 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1707.00421 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1607.03132 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1712.02850 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1710.05602 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1704.04007 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1701.00915 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1707.01551 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1701.07636 #5 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1704.04146 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1701.07605 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1603.05846 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1103.0484 #1 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 0803.2639 #1 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1010.5644 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1605.00419 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1609.07666 #6 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1609.03363 #7 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1410.6339 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1606.06099 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1605.09002 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1602.04482 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1604.07048 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1505.02903 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1501.00153 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1412.1257 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1510.02499 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1504.05058 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1504.03182 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1501.06686 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1412.6946 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1411.5861 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1406.4277 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1411.1608 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1403.2912 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1410.6094 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1409.7247 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1409.7244 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1408.0180 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1407.0915 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1405.4375 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1404.6645 #1 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1307.7252 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1211.0415 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1309.5247 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1303.3475 #1 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1202.5857 #1 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1106.2756 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 0908.3166 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 0908.2505 #4 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2511.17236 #3 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 2606.18920 #2 · arxiv_oai · confidence 0.70 Camilla Hollanti
• 1510.02499 #3 · backfill · confidence 0.70 Camilla Hollanti
• 1505.02903 #2 · backfill · confidence 0.70 Camilla Hollanti
• 1504.05058 #2 · backfill · confidence 0.70 Camilla Hollanti
• 1504.03182 #4 · backfill · confidence 0.70 Camilla Hollanti
• 1501.06686 #2 · backfill · confidence 0.70 Camilla Hollanti
• 1501.00153 #4 · backfill · confidence 0.70 Camilla Hollanti
• 1412.6946 #3 · backfill · confidence 0.70 Camilla Hollanti
• 1412.1257 #2 · backfill · confidence 0.70 Camilla Hollanti
• 1411.5861 #2 · backfill · confidence 0.70 Camilla Hollanti
• 1411.1608 #2 · backfill · confidence 0.70 Camilla Hollanti

Frequent Coauthors

• Ragnar Freij-Hollanti 24 shared papers
• David Karpuk 21 shared papers
• Amaro Barreal 14 shared papers
• Thomas Westerb\"ack 13 shared papers
• Okko Makkonen 9 shared papers
• Alex Karrila 6 shared papers
• Lukas Holzbaur 6 shared papers
• Matthias Grezet 6 shared papers
• Oliver W. Gnilke 6 shared papers
• Toni Ernvall 6 shared papers
• Jie Li 5 shared papers
• Matteo Allaix 5 shared papers
• Olav Tirkkonen 5 shared papers
• Razane Tajeddine 5 shared papers
• Antonia Wachter-Zeh 4 shared papers
• Iv\'an Blanco-Chac\'on 4 shared papers
• Joonas P\"a\"akk\"onen 4 shared papers
• Oliver Gnilke 4 shared papers
• Roope Vehkalahti 4 shared papers
• Tefjol Pllaha 4 shared papers