Ragnar Freij-Hollanti
Ragnar Freij-Hollanti
University lecturer, Aalto University
Verified email at aalto.fi
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
1482017
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
642017
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
45*2019
Resource allocation and interference management for opportunistic relaying in integrated mmWave/sub-6 GHz 5G networks
J Deng, O Tirkkonen, R Freij-Hollanti, T Chen, N Nikaein
IEEE Communications Magazine 55 (6), 94-101, 2017
452017
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
312016
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
302015
Partially ordered secretaries
R Freij, J Wästlund
Electronic Communications in Probability 15, 504-507, 2010
302010
Equivariant discrete Morse theory
R Freij
Discrete Mathematics 309 (12), 3821-3829, 2009
302009
Relay selection and resource allocation for D2D-relaying under uplink cellular power control
J Deng, AA Dowhuszko, R Freij, O Tirkkonen
2015 IEEE Globecom Workshops (GC Wkshps), 1-6, 2015
242015
Enumeration of derangements with descents in prescribed positions
N Eriksen, R Freij, J Wastlund
arXiv preprint arXiv:0811.1925, 2008
182008
Applications of polymatroid theory to distributed storage systems
T Westerbäck, R Freij-Hollanti, C Hollanti
2015 53rd Annual Allerton Conference on Communication, Control, and …, 2015
112015
On the capacity of private information retrieval from coded, colluding, and adversarial servers
L Holzbaur, R Freij-Hollanti, C Hollanti
2019 IEEE Information Theory Workshop (ITW), 1-5, 2019
102019
-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, 2018
72018
A connection between locally repairable codes and exact regenerating codes
T Ernvall, T Westerbäck, R Freij-Hollanti, C Hollanti
2016 IEEE International Symposium on Information Theory (ISIT), 650-654, 2016
72016
Face Numbers of Centrally Symmetric Polytopes Produced from Split Graphs
R Freij, M Henze, MW Schmitt, GM Ziegler
The Electronic Journal of Combinatorics 20 (2), #P32, 2013
7*2013
Matroid theory and storage codes: bounds and constructions
R Freij-Hollanti, C Hollanti, T Westerbäck
Network Coding and Subspace Designs, 385-425, 2018
62018
Towards the Capacity of Private Information Retrieval from Coded and Colluding Servers
L Holzbaur, R Freij-Hollanti, J Li, C Hollanti
arXiv preprint arXiv:1903.12552, 2019
52019
On the polymatroidal structure of quasi-uniform codes with applications to heterogeneous distributed storage
T Westerbäck, M Grezet, R Freij-Hollanti, C Hollanti
International Symposium on Mathematical Theory of Networks and Systems, 641-647, 2018
52018
Bounds on the maximal minimum distance of linear locally repairable codes
A Pöllänen, T Westerbäck, R Freij-Hollanti, C Hollanti
2016 IEEE International Symposium on Information Theory (ISIT), 1586-1590, 2016
42016
Locally repairable codes with availability and hierarchy: matroid theory via examples
R Freij-Hollanti, T Westerbäck, C Hollanti
International Zurich Seminar on Communications-Proceedings, 45-49, 2016
42016
The system can't perform the operation now. Try again later.
Articles 1–20