Follow
Camilla Hollanti
Camilla Hollanti
Professor of Mathematics, Aalto University
Verified email at aalto.fi - Homepage
Title
Cited by
Cited by
Year
Private information retrieval from coded databases with colluding servers
R Freij-Hollanti, OW Gnilke, C Hollanti, DA Karpuk
SIAM Journal on Applied Algebra and Geometry 1 (1), 647-664, 2017
2392017
On the densest MIMO lattices from cyclic division algebras
R Vehkalahti, C Hollanti, J Lahtonen, K Ranto
Information Theory, IEEE Transactions on 55 (8), 3751-3780, 2009
1002009
Private information retrieval schemes for coded data with arbitrary collusion patterns
R Tajeddine, OW Gnilke, D Karpuk, R Freij-Hollanti, C Hollanti, ...
Information Theory (ISIT), 2017 IEEE International Symposium on, 1908-1912, 2017
992017
Private information retrieval from coded storage systems with colluding, byzantine, and unresponsive servers
R Tajeddine, OW Gnilke, D Karpuk, R Freij-Hollanti, C Hollanti
IEEE Transactions on information theory 65 (6), 3898-3906, 2019
872019
Private information retrieval from coded storage systems with colluding, byzantine, and unresponsive servers
R Tajeddine, OW Gnilke, D Karpuk, R Freij-Hollanti, C Hollanti
IEEE Transactions on information theory 65 (6), 3898-3906, 2019
872019
Device-to-device data storage for mobile cellular systems
J Pääkkönen, C Hollanti, O Tirkkonen
2013 IEEE Globecom Workshops (GC Wkshps), 671-676, 2013
812013
Capacity and security of heterogeneous distributed storage systems
T Ernvall, S El Rouayheb, C Hollanti, HV Poor
IEEE Journal on Selected Areas in Communications 31 (12), 2701-2709, 2013
672013
Fast-decodable asymmetric space-time codes from division algebras
R Vehkalahti, C Hollanti, F Oggier
IEEE Transactions on Information Theory 58 (4), 2362-2385, 2011
582011
Maximal orders in the design of dense space-time lattice codes
C Hollanti, J Lahtonen, H Lu
Information Theory, IEEE Transactions on 54 (10), 4493-4510, 2008
562008
On the algebraic structure of the silver code: a 2× 2 perfect space-time block code
C Hollanti, J Lahtonen, K Ranto, R Vehkalahti, E Viterbo
2008 IEEE Information Theory Workshop, 91-94, 2008
54*2008
On the combinatorics of locally repairable codes via matroid theory
T Westerbäck, R Freij-Hollanti, T Ernvall, C Hollanti
IEEE Transactions on Information Theory 62 (10), 5296-5315, 2016
452016
CONDENSE: A reconfigurable knowledge acquisition architecture for future 5G IoT
D Vukobratovic, D Jakovetic, V Skachek, D Bajovic, D Sejdinovic, GK Kurt, ...
IEEE Access 4, 3360-3378, 2016
402016
Constructions and properties of linear locally repairable codes
T Ernvall, T Westerbäck, R Freij-Hollanti, C Hollanti
IEEE Transactions on Information Theory 62 (3), 1129-1143, 2015
382015
Toward the capacity of private information retrieval from coded and colluding servers
L Holzbaur, R Freij-Hollanti, J Li, C Hollanti
IEEE Transactions on Information Theory 68 (1), 517-537, 2021
35*2021
-Private Information Retrieval Schemes Using Transitive Codes
R Freij-Hollanti, OW Gnilke, C Hollanti, AL Horlemann-Trautmann, ...
IEEE Transactions on Information Theory 65 (4), 2107-2118, 2019
352019
Physical layer security: a paradigm shift in data confidentiality
A Chorti, C Hollanti, JC Belfiore, HV Poor
Physical and data-link security techniques for future communication systems …, 2015
342015
New space–time code constructions for two-user multiple access channels
H Lu, R Vehkalahti, C Hollanti, J Lahtonen, Y Hong, E Viterbo
IEEE Journal of Selected Topics in Signal Processing 3 (6), 939-957, 2009
332009
Construction methods for asymmetric and multiblock space–time codes
C Hollanti, HF Lu
IEEE transactions on information theory 55 (3), 1086-1103, 2009
272009
DMT optimal codes constructions for multiple-access MIMO channel
H Lu, CJ Hollanti, RI Vehkalahti, J Lahtonen
IEEE transactions on information theory 57 (6), 3594-3617, 2011
25*2011
Fast-decodable MIDO codes from crossed product algebras
F Oggier, R Vehkalahti, C Hollanti
2010 IEEE International Symposium on Information Theory, 1080-1084, 2010
242010
The system can't perform the operation now. Try again later.
Articles 1–20