Freij-HollantiAalto University

Ragnar Freij-Hollanti

Postdoctoral Researcher, Department of Mathematics and Systems Analysis

What do you do?

What do you do?

I am interested in algebraic combinatorics, especially graph theory, polytope theory and the (combinatorial and topological) theory of partial orders. In my current research, I am working on applying these and related fields to coding, communications and information theory.

With members from the research group for Algebra, Number Theory and Applications (ANTA), I am collaborating on matroid theory applied to data storage systems. In particular, I am working on bounds and constructions for locally repairable codes and private information retrieval.

My most accurate and reliable publication list can be found at Google Schoolar

CV

Download as PDF

CV

My CV, including a publication list is downloadable.

Contact information

Preferred contact method
E-mail
Work email
ragnar.freij at aalto.fi
Personal mobile phone
+358 44 2377293

Publications

Peer-reviewed scientific articles

Journal article-refereed, Original research

Resource Allocation and Interference Management for Opportunistic Relaying in Integrated mmWave/sub-6 GHz 5G Networks

Deng, Junquan; Tirkkonen, Olav; Freij-Hollanti, Ragnar; Chen, Tao; Nikaein, Navid 

2017 

IEEE Communications Magazine  

ISSN: 0163-6804 

Constructions and Properties of Linear Locally Repairable Codes

Ernvall, Toni; Westerbäck, Thomas; Freij-Hollanti, Ragnar; Hollanti, Camilla 

2016 

IEEE TRANSACTIONS ON INFORMATION THEORY 

ISSN: 0018-9448 

On the Combinatorics of Locally Repairable Codes via Matroid Theory

Westerbäck, Thomas; Freij-Hollanti, Ragnar; Ernvall, Toni; Hollanti, Camilla 

2016 

IEEE TRANSACTIONS ON INFORMATION THEORY 

ISSN: 0018-9448 

Face numers of centrally symmetric polytopes produced from split graphs

Freij, Ragnar; Henze, Mattias; Schmitt, Moritz; Ziegler, Günter 

2013 

ELECTRONIC JOURNAL OF COMBINATORICS 

ISSN: 1097-1440 

Partially ordered secretaries

Freij, Ragnar; Wästlund, Johan 

2010 

ELECTRONIC COMMUNICATIONS IN PROBABILITY 

Enumeration of derangements with descents in prescribed positions

Eriksen, Niklas; Freij, Ragnar; Wästlund, Johan 

2009 

ELECTRONIC JOURNAL OF COMBINATORICS 

ISSN: 1097-1440 

Equivariant discrete Morse theory

Freij, Ragnar 

2009 

DISCRETE MATHEMATICS 

ISSN: 0012-365X 

Conference proceedings

Relay selection and resource allocation for D2D-relaying under uplink cellular power control

Deng, Junguan; Dowhuszko, Alexis A.; Freij, Ragnar; Tirkkonen, Olav 

2016 

Institute of Electrical and Electronics Engineers Inc. 

ISBN: 9781467395267 

A connection between locally repairable codes and exact regenerating codes

Ernvall, Toni; Westerbäck, Thomas; Freij-Hollanti, Ragnar; Hollanti, Camilla 

2016 

IEEE International Symposium on Information Theory 

Institute of Electrical and Electronics Engineers Inc. 

ISBN: 978-1-5090-1806-2 

ISSN: 2157-8095 

Bounds on the maximal minimum distance of linear locally repairable codes

Pöllänen, Antti; Westerbäck, Thomas; Freij-Hollanti, Ragnar; Hollanti, Camilla 

2016 

IEEE International Symposium on Information Theory 

Institute of Electrical and Electronics Engineers Inc. 

ISBN: 978-1-5090-1806-2 

ISSN: 2157-8095 

Applications of polymatroid theory to distributed storage systems

Westerbäck, Thomas; Freij-Hollanti, Ragnar; Hollanti, Camilla 

2016 

Institute of Electrical and Electronics Engineers Inc. 

ISBN: 9781509018239 

Shifted de Bruijn Graphs

Freij, Ragnar 

2014 

SPRINGER 

Enumeration of derangements with descents in prescribed positions

Eriksen, Niklas; Freij, Ragnar; Wästlund, Johan 

2009 

Publications intended for professional communities

Article in professional conference proceedings

Locally repairable codes with availability and hierarchy: matroid theory via examples

Freij-Hollanti, Ragnar; Westerbäck, Thomas; Hollanti, Camilla 

2016 

ETH Zürich 

Reed-Muller codes for private information retrieval

Freij-Hollanti, Ragnar 

2017 

Alert