default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCamilla Hollanti
Person information
- affiliation: Aalto University, Aalto, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j42]Okko Makkonen
, Camilla Hollanti:
General Framework for Linear Secure Distributed Matrix Multiplication With Byzantine Servers. IEEE Trans. Inf. Theory 70(6): 3864-3877 (2024)- [c65]Okko Makkonen, David A. Karpuk, Camilla Hollanti:
Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval. ISIT 2024: 2874-2879 - [c64]Neehar Verma, Camilla Hollanti:
Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack. ISIT 2024: 2880-2885 - [i82]Neehar Verma, Camilla Hollanti:
Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack. CoRR abs/2402.02871 (2024) - [i81]Okko Makkonen, Sampo Niemelä, Camilla Hollanti, Serge Kas Hanna:
Approximate Gradient Coding for Privacy-Flexible Federated Learning with Non-IID Data. CoRR abs/2404.03524 (2024) - [i80]Okko Makkonen, David A. Karpuk, Camilla Hollanti:
Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval. CoRR abs/2405.18052 (2024) - [i79]Okko Makkonen, David A. Karpuk, Camilla Hollanti:
Secret Sharing for Secure and Private Information Retrieval: A Construction Using Algebraic Geometry Codes. CoRR abs/2408.00542 (2024) - 2023
- [c63]Matteo Allaix, Yuxiang Lu, Yuhang Yao, Tefjol Pllaha, Camilla Hollanti, Syed Ali Jafar:
N-Sum Box: An Abstraction for Linear Computation over Many-to-one Quantum Networks. GLOBECOM 2023: 5457-5462 - [c62]Okko Makkonen, Camilla Hollanti:
Secure Distributed Gram Matrix Multiplication. ITW 2023: 192-197 - [i78]Camilla Hollanti, Okko Makkonen, Elif Saçikara:
Algebraic Geometry Codes for Secure Distributed Matrix Multiplication. CoRR abs/2303.15429 (2023) - [i77]Matteo Allaix, Yuxiang Lu, Yuhang Yao, Tefjol Pllaha, Camilla Hollanti, Syed Ali Jafar:
N-Sum Box: An Abstraction for Linear Computation over Many-to-one Quantum Networks. CoRR abs/2304.07561 (2023) - [i76]Lenny Fukshansky, Camilla Hollanti:
Euclidean lattices: theory and applications. CoRR abs/2307.08137 (2023) - 2022
- [j41]Jie Li, Okko Makkonen, Camilla Hollanti, Oliver W. Gnilke:
Efficient Recovery of a Shared Secret via Cooperation: Applications to SDMM and PIR. IEEE J. Sel. Areas Commun. 40(3): 871-884 (2022) - [j40]Matteo Allaix, Seunghoan Song, Lukas Holzbaur, Tefjol Pllaha, Masahito Hayashi, Camilla Hollanti:
On the Capacity of Quantum Private Information Retrieval From MDS-Coded and Colluding Servers. IEEE J. Sel. Areas Commun. 40(3): 885-898 (2022) - [j39]Jie Li, Xiaohu Tang, Camilla Hollanti:
A Generic Transformation for Optimal Node Repair in MDS Array Codes Over F2. IEEE Trans. Commun. 70(2): 727-738 (2022) - [j38]Jie Li, Camilla Hollanti:
Private and Secure Distributed Matrix Multiplication Schemes for Replicated or MDS-Coded Servers. IEEE Trans. Inf. Forensics Secur. 17: 659-669 (2022) - [j37]Lukas Holzbaur, Ragnar Freij-Hollanti, Jie Li, Camilla Hollanti:
Toward the Capacity of Private Information Retrieval From Coded and Colluding Servers. IEEE Trans. Inf. Theory 68(1): 517-537 (2022) - [c61]Okko Makkonen, Camilla Hollanti:
Analog Secure Distributed Matrix Multiplication over Complex Numbers. ISIT 2022: 1211-1216 - [c60]Perttu Saarela, Matteo Allaix, Ragnar Freij-Hollanti, Camilla Hollanti:
Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes. ISIT 2022: 2839-2844 - [c59]Okko Makkonen, Camilla Hollanti:
General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers. ITW 2022: 143-148 - [i75]Okko Makkonen, Camilla Hollanti:
Analog Secure Distributed Matrix Multiplication over Complex Numbers. CoRR abs/2202.03352 (2022) - [i74]Perttu Saarela, Matteo Allaix, Ragnar Freij-Hollanti, Camilla Hollanti:
Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes. CoRR abs/2202.09095 (2022) - [i73]Okko Makkonen, Camilla Hollanti:
General Framework for Linear Secure Distributed Matrix Multiplication with Byzantine Servers. CoRR abs/2205.07052 (2022) - [i72]Okko Makkonen, Camilla Hollanti:
Secure Distributed Gram Matrix Multiplication. CoRR abs/2211.14213 (2022) - 2021
- [j36]Ragnar Freij-Hollanti, Matthias Grezet, Camilla Hollanti, Thomas Westerbäck:
Cyclic flats of binary matroids. Adv. Appl. Math. 127: 102165 (2021) - [j35]Matthias Grezet, Camilla Hollanti:
The complete hierarchical locality of the punctured Simplex code. Des. Codes Cryptogr. 89(1): 105-125 (2021) - [j34]Julien Lavauzelle, Razane Tajeddine, Ragnar Freij-Hollanti, Camilla Hollanti:
Private Information Retrieval Schemes With Product-Matrix MBR Codes. IEEE Trans. Inf. Forensics Secur. 16: 441-450 (2021) - [j33]Mohamed Taoufiq Damir, Alex Karrila, Laia Amorós, Oliver W. Gnilke, David A. Karpuk, Camilla Hollanti:
Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels. IEEE Trans. Inf. Theory 67(6): 3645-3663 (2021) - [c58]Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha, Camilla Hollanti:
High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes. ISIT 2021: 1046-1051 - [c57]Jie Li, Camilla Hollanti:
Improved Private and Secure Distributed Matrix Multiplication. ISIT 2021: 1859-1864 - [i71]Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha, Camilla Hollanti:
High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes. CoRR abs/2102.02511 (2021) - [i70]Jie Li, Camilla Hollanti, Oliver W. Gnilke:
Efficient Recovery of a Shared Secret via Cooperation: Applications to SDMM and PIR. CoRR abs/2106.05785 (2021) - [i69]Jie Li, Camilla Hollanti:
Improved Private and Secure Distributed (Batch) Matrix Multiplication. CoRR abs/2106.11214 (2021) - [i68]Matteo Allaix, Seunghoan Song, Lukas Holzbaur, Tefjol Pllaha, Masahito Hayashi, Camilla Hollanti:
On the Capacity of Quantum Private Information Retrieval from MDS-Coded and Colluding Servers. CoRR abs/2106.14719 (2021) - 2020
- [j32]Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha, Camilla Hollanti:
Quantum Private Information Retrieval From Coded and Colluding Servers. IEEE J. Sel. Areas Inf. Theory 1(2): 599-610 (2020) - [j31]Amaro Barreal, Mohamed Taoufiq Damir, Ragnar Freij-Hollanti, Camilla Hollanti:
An Approximation of Theta Functions with Applications to Communications. SIAM J. Appl. Algebra Geom. 4(4): 471-501 (2020) - [j30]Jie Li, David A. Karpuk, Camilla Hollanti:
Towards Practical Private Information Retrieval From MDS Array Codes. IEEE Trans. Commun. 68(6): 3415-3425 (2020) - [j29]Razane Tajeddine, Antonia Wachter-Zeh, Camilla Hollanti:
Private Information Retrieval Over Random Linear Networks. IEEE Trans. Inf. Forensics Secur. 15: 790-799 (2020) - [j28]Lukas Holzbaur, Ragnar Freij-Hollanti, Antonia Wachter-Zeh, Camilla Hollanti:
Private Streaming With Convolutional Codes. IEEE Trans. Inf. Theory 66(4): 2417-2429 (2020) - [c56]Julian Renner, Sven Puchinger, Antonia Wachter-Zeh, Camilla Hollanti, Ragnar Freij-Hollanti:
Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power. ISIT 2020: 19-24 - [c55]Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha, Camilla Hollanti:
Quantum Private Information Retrieval from MDS-coded and Colluding Servers. ISIT 2020: 1059-1064 - [c54]Lukas Holzbaur, Camilla Hollanti, Antonia Wachter-Zeh:
Computational Code-Based Single-Server Private Information Retrieval. ISIT 2020: 1065-1070 - [i67]Julian Renner, Sven Puchinger, Antonia Wachter-Zeh, Camilla Hollanti, Ragnar Freij-Hollanti:
Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power. CoRR abs/2001.04800 (2020) - [i66]Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha, Camilla Hollanti:
Quantum Private Information Retrieval from MDS-coded and Colluding Servers. CoRR abs/2001.05883 (2020) - [i65]Lukas Holzbaur, Camilla Hollanti, Antonia Wachter-Zeh:
Computational Code-Based Single-Server Private Information Retrieval. CoRR abs/2001.07049 (2020)
2010 – 2019
- 2019
- [j27]Oliver W. Gnilke, Marcus Greferath, Camilla Hollanti, Guillermo Nuñez Ponasso, Padraig Ó Catháin, Eric Swartz:
Improved user-private information retrieval via finite geometry. Des. Codes Cryptogr. 87(2-3): 665-677 (2019) - [j26]Matthias Grezet, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Uniform Minors in Maximally Recoverable Codes. IEEE Commun. Lett. 23(8): 1297-1300 (2019) - [j25]Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Ivo Kubjas:
$t$ -Private Information Retrieval Schemes Using Transitive Codes. IEEE Trans. Inf. Theory 65(4): 2107-2118 (2019) - [j24]Razane Tajeddine, Oliver W. Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti:
Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers. IEEE Trans. Inf. Theory 65(6): 3898-3906 (2019) - [j23]Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck, Camilla Hollanti:
Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes. IEEE Trans. Inf. Theory 65(10): 6089-6100 (2019) - [j22]Joonas Pääkkönen, Amaro Barreal, Camilla Hollanti, Olav Tirkkonen:
Coded Caching Clusters with Device-to-Device Communications. IEEE Trans. Mob. Comput. 18(2): 264-275 (2019) - [c53]Matthias Grezet, Camilla Hollanti:
The Complete Hierarchical Locality of the Punctured Simplex Code. ISIT 2019: 2833-2837 - [c52]Lukas Holzbaur, Ragnar Freij-Hollanti, Camilla Hollanti:
On the Capacity of Private Information Retrieval from Coded, Colluding, and Adversarial Servers. ITW 2019: 1-5 - [c51]Joonas Pääkkönen, Prathapasinghe Dharmawansa, Ragnar Freij-Hollanti, Camilla Hollanti, Olav Tirkkonen:
File Size Distributions and Caching for Offloading. SPAWC 2019: 1-5 - [i64]Matthias Grezet, Camilla Hollanti:
The Complete Hierarchical Locality of the Punctured Simplex Code. CoRR abs/1901.03149 (2019) - [i63]Lukas Holzbaur, Ragnar Freij-Hollanti, Camilla Hollanti:
On the Capacity of Private Information Retrieval from Coded, Colluding, and Adversarial Servers. CoRR abs/1903.12552 (2019) - [i62]Matthias Grezet, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Uniform Minors in Maximally Recoverable Codes. CoRR abs/1906.02423 (2019) - [i61]Jie Li, David A. Karpuk, Camilla Hollanti:
Private Information Retrieval from MDS Array Codes with (Near-) Optimal Repair Bandwidth. CoRR abs/1909.10289 (2019) - 2018
- [j21]Amaro Barreal, Capi Corrales Rodrigáñez, Camilla Hollanti:
Natural orders for asymmetric space-time coding: minimizing the discriminant. Appl. Algebra Eng. Commun. Comput. 29(5): 371-391 (2018) - [j20]Simon R. Blackburn, Marcus Greferath, Camilla Hollanti, Mario-Osvin Pavcevic, Joachim Rosenthal, Leo Storme, Ángeles Vázquez-Castro, Alfred Wassermann:
Preface to the special issue on network coding and designs. Des. Codes Cryptogr. 86(2): 237-238 (2018) - [j19]Renaud-Alexandre Pitaval, Lu Wei, Olav Tirkkonen, Camilla Hollanti:
Density of Spherically Embedded Stiefel and Grassmann Codes. IEEE Trans. Inf. Theory 64(1): 225-248 (2018) - [c50]Razan Tajeddine, Oliver W. Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti:
Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers. ISIT 2018: 2451-2455 - [c49]Lukas Holzbaur, Ragnar Freij-Hollanti, Antonia Wachter-Zeh, Camilla Hollanti:
Private Streaming with Convolutional Codes. ITW 2018: 1-5 - [c48]Mohamed Taoufiq Damir, Oliver W. Gnilke, Laia Amorós, Camilla Hollanti:
Analysis of Some Well-Rounded Lattices in Wiretap Channels. SPAWC 2018: 1-5 - [i60]Razan Tajeddine, Oliver W. Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti:
Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers. CoRR abs/1802.03731 (2018) - [i59]Lukas Holzbaur, Ragnar Freij-Hollanti, Antonia Wachter-Zeh, Camilla Hollanti:
Private Streaming with Convolutional Codes. CoRR abs/1806.00239 (2018) - [i58]Razan Tajeddine, Oliver W. Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti:
Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers. CoRR abs/1806.08006 (2018) - [i57]Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck, Camilla Hollanti:
Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes. CoRR abs/1810.08510 (2018) - [i56]Razan Tajeddine, Antonia Wachter-Zeh, Camilla Hollanti:
Private Information Retrieval over Networks. CoRR abs/1810.08941 (2018) - [i55]Julien Lavauzelle, Razane Tajeddine, Ragnar Freij-Hollanti, Camilla Hollanti:
Private Information Retrieval Schemes with Regenerating Codes. CoRR abs/1811.02898 (2018) - 2017
- [j18]Francisco A. Monteiro, Alister G. Burr, Ioannis Chatzigeorgiou, Camilla Hollanti, Ioannis Krikidis, Hulya Seferoglu, Vitaly Skachek:
Special issue on network coding. EURASIP J. Adv. Signal Process. 2017: 29 (2017) - [j17]Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti, David A. Karpuk:
Private Information Retrieval from Coded Databases with Colluding Servers. SIAM J. Appl. Algebra Geom. 1(1): 647-664 (2017) - [c47]Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck, Camilla Hollanti:
On Binary Matroid Minors and Applications to Data Storage over Small Fields. ICMCTA 2017: 139-153 - [c46]Razan Tajeddine, Oliver W. Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti, Salim El Rouayheb:
Private information retrieval schemes for codec data with arbitrary collusion patterns. ISIT 2017: 1908-1912 - [c45]Alex Karrila, Niko R. Väisänen, David A. Karpuk, Camilla Hollanti:
Lattice coding for Rician fading channels from Hadamard rotations. ISIT 2017: 3110-3114 - [i54]Alex Karrila, Niko R. Väisänen, David A. Karpuk, Camilla Hollanti:
Lattice coding for Rician fading channels from Hadamard rotations. CoRR abs/1701.07605 (2017) - [i53]Razan Tajeddine, Oliver W. Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti, Salim El Rouayheb:
Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns. CoRR abs/1701.07636 (2017) - [i52]Ragnar Freij-Hollanti, Camilla Hollanti, Thomas Westerbäck:
Matroid Theory and Storage Codes: Bounds and Constructions. CoRR abs/1704.04007 (2017) - [i51]Joonas Pääkkönen, K. D. Prathapasinghe Dharmawansa, Ragnar Freij-Hollanti, Camilla Hollanti, Olav Tirkkonen:
Traffic Minimizing Caching and Latent Variable Distributions of Order Statistics. CoRR abs/1704.04146 (2017) - [i50]Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck, Camilla Hollanti:
On Binary Matroid Minors and Applications to Data Storage over Small Fields. CoRR abs/1707.00421 (2017) - [i49]Oliver W. Gnilke, Marcus Greferath, Camilla Hollanti, Guillermo Nuñez Ponasso, Padraig Ó Catháin, Eric Swartz:
Improved User-Private Information Retrieval via Finite Geometry. CoRR abs/1707.01551 (2017) - [i48]Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck, Oktay Olmez, Camilla Hollanti:
Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures. CoRR abs/1709.05801 (2017) - [i47]Amaro Barreal, Camilla Hollanti:
On Fast-Decodable Algebraic Space-Time Codes. CoRR abs/1710.05602 (2017) - [i46]Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Ivo Kubjas:
t-Private Information Retrieval Schemes Using Transitive Codes. CoRR abs/1712.02850 (2017) - 2016
- [j16]Dejan Vukobratovic, Dusan Jakovetic, Vitaly Skachek, Dragana Bajovic, Dino Sejdinovic, Günes Karabulut-Kurt, Camilla Hollanti, Ingo Fischer:
CONDENSE: A Reconfigurable Knowledge Acquisition Architecture for Future 5G IoT. IEEE Access 4: 3360-3378 (2016) - [j15]Hsiao-feng Francis Lu, Amaro Barreal, David A. Karpuk, Camilla Hollanti:
Efficiently sphere-decodable physical layer transmission schemes for wireless storage networks. EURASIP J. Adv. Signal Process. 2016: 56 (2016) - [j14]Toni Ernvall, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Constructions and Properties of Linear Locally Repairable Codes. IEEE Trans. Inf. Theory 62(3): 1129-1143 (2016) - [j13]Thomas Westerbäck, Ragnar Freij-Hollanti, Toni Ernvall, Camilla Hollanti:
On the Combinatorics of Locally Repairable Codes via Matroid Theory. IEEE Trans. Inf. Theory 62(10): 5296-5315 (2016) - [j12]Amaro Barreal, Camilla Hollanti, Nadya Markin:
Fast-Decodable Space-Time Codes for the N-Relay and Multiple-Access MIMO Channel. IEEE Trans. Wirel. Commun. 15(3): 1754-1767 (2016) - [j11]David A. Karpuk, Camilla Hollanti:
Locally Diverse Constellations From the Special Orthogonal Group. IEEE Trans. Wirel. Commun. 15(6): 4426-4437 (2016) - [c44]Toni Ernvall, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
A connection between locally repairable codes and exact regenerating codes. ISIT 2016: 650-654 - [c43]Antti Pöllänen, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Bounds on the maximal minimum distance of linear locally repairable codes. ISIT 2016: 1586-1590 - [c42]Amaro Barreal, Alex Karrila, David A. Karpuk, Camilla Hollanti:
Information bounds and flatness factor approximation for fading wiretap MIMO channels. ITNAC 2016: 277-282 - [c41]Oliver W. Gnilke, Amaro Barreal, Alex Karrila, Ha Thanh Nguyen Tran, David A. Karpuk, Camilla Hollanti:
Well-rounded lattices for coset coding in MIMO wiretap channels. ITNAC 2016: 289-294 - [c40]Oliver Wilhelm Gnilke, Ha Thanh Nguyen Tran, Alex Karrila, Camilla Hollanti:
Well-rounded lattices for reliability and security in Rayleigh fading SISO channels. ITW 2016: 359-363 - [i45]Amaro Barreal, David A. Karpuk, Camilla Hollanti:
Decoding in Compute-and-Forward Relaying: Real Lattices and the Flatness of Lattice Sums. CoRR abs/1601.05596 (2016) - [i44]Antti Pöllänen, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Improved Singleton-type Bounds for Locally Repairable Codes. CoRR abs/1602.04482 (2016) - [i43]Toni Ernvall, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
A Connection Between Locally Repairable Codes and Exact Regenerating Codes. CoRR abs/1603.05846 (2016) - [i42]David A. Karpuk, Amaro Barreal, Oliver W. Gnilke, Camilla Hollanti:
Nested Lattice Codes for Vector Perturbation Systems. CoRR abs/1604.07048 (2016) - [i41]Oliver Wilhelm Gnilke, Ha Thanh Nguyen Tran, Alex Karrila, Camilla Hollanti:
Well-Rounded Lattices for Reliability and Security in Rayleigh Fading SISO Channels. CoRR abs/1605.00419 (2016) - [i40]Joonas Pääkkönen, Amaro Barreal, Camilla Hollanti, Olav Tirkkonen:
Coded Caching Clusters with Device-to-Device Communications. CoRR abs/1605.09002 (2016) - [i39]Alex Karrila, Amaro Barreal, David A. Karpuk, Camilla Hollanti:
Information Bounds and Flatness Factor Approximation for Fading Wiretap Channels. CoRR abs/1606.06099 (2016) - [i38]Renaud-Alexandre Pitaval, Lu Wei, Olav Tirkkonen, Camilla Hollanti:
Density of Spherically-Embedded Stiefel and Grassmann Codes. CoRR abs/1607.03132 (2016) - [i37]Dejan Vukobratovic, Dusan Jakovetic, Vitaly Skachek, Dragana Bajovic, Dino Sejdinovic, Gunes Karabulut-Kurt, Camilla Hollanti, Ingo Fischer:
CONDENSE: A Reconfigurable Knowledge Acquisition Architecture for Future 5G IoT. CoRR abs/1609.03363 (2016) - [i36]Oliver W. Gnilke, Amaro Barreal, Alex Karrila, Ha Thanh Nguyen Tran, David A. Karpuk, Camilla Hollanti:
Well-Rounded Lattices for Coset Coding in MIMO Wiretap Channels. CoRR abs/1609.07666 (2016) - [i35]Alex Karrila, David A. Karpuk, Camilla Hollanti:
On Analytical and Geometric Lattice Design Criteria for Wiretap Coset Codes. CoRR abs/1609.07723 (2016) - [i34]Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti, David A. Karpuk:
Private Information Retrieval from Coded Databases with Colluding Servers. CoRR abs/1611.02062 (2016) - 2015
- [j10]David A. Karpuk, Anne-Maria Ernvall-Hytönen, Camilla Hollanti, Emanuele Viterbo:
Probability estimates for fading and wiretap channels from ideal class zeta functions. Adv. Math. Commun. 9(4): 391-413 (2015) - [c39]Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Applications of polymatroid theory to distributed storage systems. Allerton 2015: 231-237 - [c38]Alex Karrila, Camilla Hollanti:
A comparison of skewed and orthogonal lattices in Gaussian wiretap channels. ITW 2015: 1-5 - [c37]Amaro Barreal, Joonas Pääkkönen, David A. Karpuk, Camilla Hollanti, Olav Tirkkonen:
A low-complexity message recovery method for Compute-and-Forward relaying. ITW Fall 2015: 39-43 - [c36]Joonas Pääkkönen, Camilla Hollanti, Olav Tirkkonen:
Device-to-Device Data Storage with Regenerating Codes. MACOM 2015: 57-69 - [i33]Thomas Westerbäck, Ragnar Freij, Toni Ernvall, Camilla Hollanti:
On the Combinatorics of Locally Repairable Codes via Matroid Theory. CoRR abs/1501.00153 (2015) - [i32]Amaro Barreal, Camilla Hollanti, David A. Karpuk:
Reduced Complexity Decoding of n x n Algebraic Space-Time Codes. CoRR abs/1501.06686 (2015) - [i31]Amaro Barreal, Joonas Pääkkönen, David A. Karpuk, Camilla Hollanti, Olav Tirkkonen:
A Low-Complexity Message Recovery Method for Compute-and-Forward Relaying. CoRR abs/1504.03182 (2015) - [i30]Amaro Barreal, Camilla Hollanti, Nadya Markin:
Constructions of Fast-Decodable Distributed Space-Time Codes. CoRR abs/1504.05058 (2015) - [i29]David A. Karpuk, Camilla Hollanti:
Locally Diverse Constellations from the Special Orthogonal Group. CoRR abs/1505.02903 (2015) - [i28]Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Applications of Polymatroid Theory to Distributed Storage Systems. CoRR abs/1510.02499 (2015) - 2014
- [j9]Iván Blanco-Chacón, Dionís Remón, Camilla Hollanti, Montserrat Alsina:
Nonuniform Fuchsian codes for noisy channels. J. Frankl. Inst. 351(11): 5076-5098 (2014) - [c35]David A. Karpuk, Camilla Hollanti:
Rotating non-uniform and high-dimensional constellations using geodesic flow on lie groups. ICC 2014: 5884-5889 - [c34]Arsenia Chorti, Mehdi M. Molu, David A. Karpuk, Camilla Hollanti, Alister G. Burr:
Strong secrecy in wireless network coding systems with M-QAM modulators. ICCC 2014: 181-186 - [c33]Amaro Barreal, Camilla Hollanti, Nadya Markin:
Constructions of Fast-Decodable Distributed Space-Time Codes. ICMCTA 2014: 43-51 - [c32]Toni Ernvall, Salim El Rouayheb, Camilla Hollanti, H. Vincent Poor:
Secrecy capacity of heterogeneous distributed storage systems. ISCCSP 2014: 9 - [c31]David A. Karpuk, Camilla Hollanti, Amaro Barreal:
Node repair for distributed storage systems over fading channels. ISITA 2014: 383-387 - [c30]Camilla Hollanti, Hsiao-feng Lu, David A. Karpuk, Amaro Barreal:
New relay-based transmission protocols for wireless distributed storage systems. ISITA 2014: 585-589 - [c29]David A. Karpuk, Camilla Hollanti:
Multi-dimensional and non-uniform constellation optimization via the special orthogonal group. ITW 2014: 287-291 - [c28]Thomas Westerbäck, Toni Ernvall, Camilla Hollanti:
Almost affine locally repairable codes and matroid theory. ITW 2014: 621-625 - [c27]Toni Ernvall, Thomas Westerbäck, Camilla Hollanti:
Constructions of optimal and almost optimal locally repairable codes. VITAE 2014: 1-5 - [c26]Camilla Hollanti, David A. Karpuk, Amaro Barreal, Hsiao-feng Francis Lu:
Space-time storage codes for wireless distributed storage systems. VITAE 2014: 1-5 - [i27]Iván Blanco-Chacón, Dionís Remón, Camilla Hollanti, Montserrat Alsina:
Nonuniform Fuchsian codes for noisy channels. CoRR abs/1403.2912 (2014) - [i26]Camilla Hollanti, David A. Karpuk, Amaro Barreal, Hsiao-feng Francis Lu:
Space-Time Storage Codes for Wireless Distributed Storage Systems. CoRR abs/1404.6645 (2014) - [i25]Amaro Barreal, Camilla Hollanti, David A. Karpuk, Hsiao-feng Lu:
Algebraic Codes and a New Physical Layer Transmission Protocol for Wireless Distributed Storage Systems. CoRR abs/1405.4375 (2014) - [i24]Toni Ernvall, Thomas Westerbäck, Camilla Hollanti:
Constructions of Optimal and Almost Optimal Locally Repairable Codes. CoRR abs/1406.4277 (2014) - [i23]Arsenia Chorti, Mehdi M. Molu, David A. Karpuk, Camilla Hollanti, Alister G. Burr:
Strong Secrecy in Wireless Network Coding Systems with M-QAM Modulators. CoRR abs/1407.0915 (2014) - [i22]Toni Ernvall, Thomas Westerbäck, Camilla Hollanti:
Linear Locally Repairable Codes with Random Matrices. CoRR abs/1408.0180 (2014) - [i21]David A. Karpuk, Camilla Hollanti:
Multi-Dimensional and Non-Uniform Constellation Optimization via the Special Orthogonal Group. CoRR abs/1409.7244 (2014) - [i20]David A. Karpuk, Camilla Hollanti, Amaro Barreal:
Node Repair for Distributed Storage Systems over Fading Channels. CoRR abs/1409.7247 (2014) - [i19]Iván Blanco-Chacón, Camilla Hollanti, Montserrat Alsina, Dionís Remón:
Fuchsian codes with arbitrarily high code rate. CoRR abs/1410.6094 (2014) - [i18]Toni Ernvall, Thomas Westerbäck, Camilla Hollanti, Ragnar Freij:
Constructions and Properties of Linear Locally Repairable Codes. CoRR abs/1410.6339 (2014) - [i17]Joonas Pääkkönen, Camilla Hollanti, Olav Tirkkonen:
Device-to-Device Data Storage with Regenerating Codes. CoRR abs/1411.1608 (2014) - [i16]Alex Karrila, Camilla Hollanti:
A Comparison of Skewed and Orthogonal Lattices in Gaussian Wiretap Channels. CoRR abs/1411.5861 (2014) - [i15]Amaro Barreal, Camilla Hollanti, Nadya Markin:
Fast-Decodable Space-Time Codes for the $N$-Relay and Multiple-Access MIMO Channel. CoRR abs/1412.1257 (2014) - [i14]David A. Karpuk, Anne-Maria Ernvall-Hytönen, Camilla Hollanti, Emanuele Viterbo:
Probability Estimates for Fading and Wiretap Channels from Ideal Class Zeta Functions. CoRR abs/1412.6946 (2014) - 2013
- [j8]Toni Ernvall, Salim El Rouayheb, Camilla Hollanti, H. Vincent Poor:
Capacity and Security of Heterogeneous Distributed Storage Systems. IEEE J. Sel. Areas Commun. 31(12): 2701-2709 (2013) - [c25]Joonas Pääkkönen, Camilla Hollanti, Olav Tirkkonen:
Device-to-device data storage for mobile cellular systems. GLOBECOM Workshops 2013: 671-676 - [c24]Toni Ernvall, Salim El Rouayheb, Camilla Hollanti, H. Vincent Poor:
Capacity and security of heterogeneous distributed storage systems. ISIT 2013: 1247-1251 - [c23]David A. Karpuk, Iván Blanco-Chacón, Camilla Hollanti:
Probability bounds for an eavesdropper's correct decision over a MIMO wiretap channel. ISIT 2013: 2014-2018 - [i13]Camilla Hollanti, Emanuele Viterbo, David A. Karpuk:
Nonasymptotic Probability Bounds for Fading Channels Exploiting Dedekind Zeta Functions. CoRR abs/1303.3475 (2013) - [i12]Iván Blanco-Chacón, Dionís Remón, Camilla Hollanti, Montserrat Alsina:
Fuchsian codes for AWGN channels. CoRR abs/1307.7252 (2013) - [i11]David A. Karpuk, Camilla Hollanti:
Rotating Non-Uniform and High-Dimensional Constellations Using Geodesic Flow on Lie Groups. CoRR abs/1309.5247 (2013) - [i10]Joonas Pääkkönen, Camilla Hollanti, Olav Tirkkonen:
Device-to-Device Data Storage for Mobile Cellular Systems. CoRR abs/1309.6123 (2013) - 2012
- [j7]Roope Vehkalahti, Camilla Hollanti, Frédérique E. Oggier:
Fast-Decodable Asymmetric Space-Time Codes From Division Algebras. IEEE Trans. Inf. Theory 58(4): 2362-2385 (2012) - [c22]Camilla Hollanti, Nadya Markin:
Algebraic fast-decodable relay codes for distributed communications. ISIT 2012: 935-939 - [c21]Joonas Pääkkönen, K. D. Prathapasinghe Dharmawansa, Camilla Hollanti, Olav Tirkkonen:
Distributed storage for proximity based services. Swe-CTW 2012: 30-35 - [i9]Camilla Hollanti, Nadya Markin:
Algebraic Fast-Decodable Relay Codes for Distributed Communications. CoRR abs/1202.5857 (2012) - [i8]Toni Ernvall, Salim El Rouayheb, Camilla Hollanti, H. Vincent Poor:
Capacity and Security of Heterogeneous Distributed Storage Systems. CoRR abs/1211.0415 (2012) - 2011
- [j6]Hsiao-feng Lu, Camilla Hollanti, Roope Vehkalahti, Jyrki T. Lahtonen:
DMT Optimal Codes Constructions for Multiple-Access MIMO Channel. IEEE Trans. Inf. Theory 57(6): 3594-3617 (2011) - [c20]Camilla Hollanti, Emanuele Viterbo:
Analysis on wiretap lattice codes and probability bounds from Dedekind zeta functions. ICUMT 2011: 1-8 - [c19]Roope Vehkalahti, Camilla Hollanti:
A general framework for constructing fast-decodable asymmetric space-time codes. ISIT 2011: 2821-2825 - [c18]Roope Vehkalahti, Camilla Hollanti:
Reducing complexity with less than minimum delay space-time lattice codes. ITW 2011: 130-134 - [c17]Anne-Maria Ernvall-Hytönen, Camilla Hollanti:
On the eavesdropper's correct decision in Gaussian and fading wiretap channels using lattice codes. ITW 2011: 210-214 - [c16]Camilla Hollanti, Roope Vehkalahti, Youssef Nasser:
Algebraic hybrid satellite-terrestrial space-time codes for digital broadcasting in SFN. SiPS 2011: 234-238 - [i7]Camilla Hollanti, Roope Vehkalahti, Youssef Nasser:
Algebraic Hybrid Satellite-Terrestrial Space-Time Codes for Digital Broadcasting in SFN. CoRR abs/1103.0484 (2011) - [i6]Anne-Maria Ernvall-Hytönen, Camilla Hollanti:
On the Eavesdropper's Correct Decision in Gaussian and Fading Wiretap Channels Using Lattice Codes. CoRR abs/1106.2756 (2011) - 2010
- [j5]Hsiao-feng Lu, Camilla Hollanti:
Optimal diversity-multiplexing tradeoff and code constructions of some constrained asymmetric MIMO systems. IEEE Trans. Inf. Theory 56(5): 2121-2129 (2010) - [c15]Frédérique E. Oggier, Roope Vehkalahti, Camilla Hollanti:
Fast-decodable MIDO codes from crossed product algebras. ISIT 2010: 1080-1084 - [c14]Roope Vehkalahti, Camilla Hollanti, Jyrki T. Lahtonen:
A family of cyclic division algebra based fast-decodable 4×2 space-time block codes. ISITA 2010: 42-47 - [c13]Roope Vehkalahti, Camilla Hollanti, Jyrki T. Lahtonen, Hsiao-feng Lu:
Some simple observations on MISO codes. ISITA 2010: 537-541 - [i5]Roope Vehkalahti, Camilla Hollanti, Frédérique E. Oggier:
Fast-Decodable Asymmetric Space-Time Codes from Division Algebras. CoRR abs/1010.5644 (2010)
2000 – 2009
- 2009
- [j4]Hsiao-feng Lu, Roope Vehkalahti, Camilla Hollanti, Jyrki T. Lahtonen, Yi Hong, Emanuele Viterbo:
New Space-Time Code Constructions for Two-User Multiple Access Channels. IEEE J. Sel. Top. Signal Process. 3(6): 939-957 (2009) - [j3]Camilla Hollanti, Hsiao-feng Lu:
Construction Methods for Asymmetric and Multiblock Space-Time Codes. IEEE Trans. Inf. Theory 55(3): 1086-1103 (2009) - [j2]Roope Vehkalahti, Camilla Hollanti, Jyrki T. Lahtonen, Kalle Ranto:
On the densest MIMO lattices from cyclic division algebras. IEEE Trans. Inf. Theory 55(8): 3751-3780 (2009) - [c12]Camilla Hollanti, Roope Vehkalahti, Hsiao-feng Lu:
An algebraic tool for obtaining conditional non-vanishing determinants. ISIT 2009: 1388-1392 - [c11]Hsiao-feng Lu, Camilla Hollanti:
Diversity-multiplexing tradeoff-optimal code constructions for symmetric MIMO multiple access channels. ISIT 2009: 1864-1868 - [i4]Jyrki T. Lahtonen, Roope Vehkalahti, Hsiao-feng Lu, Camilla Hollanti, Emanuele Viterbo:
On the Decay of the Determinants of Multiuser MIMO Lattice Codes. CoRR abs/0908.2505 (2009) - [i3]Hsiao-feng Lu, Jyrki T. Lahtonen, Roope Vehkalahti, Camilla Hollanti:
Remarks on the Criteria of Constructing MIMO-MAC DMT Optimal Codes. CoRR abs/0908.3166 (2009) - 2008
- [j1]Camilla Hollanti, Jyrki T. Lahtonen, Hsiao-feng Lu:
Maximal Orders in the Design of Dense Space-Time Lattice Codes. IEEE Trans. Inf. Theory 54(10): 4493-4510 (2008) - [c10]Camilla Hollanti, Hsiao-feng Lu:
Constructing asymmetric space-time codes with the Smart Puncturing Method. ISIT 2008: 1488-1492 - [c9]Hsiao-feng Lu, Camilla Hollanti:
On the construction of DMT-Optimal AST codes with transmit antenna selection. ISIT 2008: 2371-2374 - [c8]Camilla Hollanti, Jyrki T. Lahtonen, Kalle Ranto, Roope Vehkalahti, Emanuele Viterbo:
On the algebraic structure of the Silver code: A 2 × 2 perfect space-time block code. ITW 2008: 91-94 - [i2]Camilla Hollanti, Jyrki T. Lahtonen, Hsiao-feng Lu:
Maximal Orders in the Design of Dense Space-Time Lattice Codes. CoRR abs/0803.2639 (2008) - 2007
- [c7]Camilla Hollanti, Hsiao-feng Lu:
Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes. AAECC 2007: 227-236 - [c6]Camilla Hollanti, Kalle Ranto:
On MIDO Space-Time Block Codes. ISIT 2007: 1631-1635 - [c5]Camilla Hollanti, Kalle Ranto:
Asymmetric Space-Time Block Codes for MIMO Systems. ITW 2007: 1-5 - [i1]Camilla Hollanti, Jyrki T. Lahtonen, Kalle Ranto, Roope Vehkalahti:
On the densest MIMO lattices from cyclic division algebras. CoRR abs/cs/0703052 (2007) - 2006
- [c4]Camilla Hollanti, Jyrki T. Lahtonen, Kalle Ranto, Roope Vehkalahti:
Optimal Matrix Lattices for MIMO Codes from Division Algebras. ISIT 2006: 783-787 - [c3]Camilla Hollanti, Jyrki T. Lahtonen:
A New Tool: Constructing STBCs from Maximal Orders in Central Simple Algebras. ITW 2006: 322-326 - 2005
- [c2]Jarkko Hiltunen, Camilla Hollanti, Jyrki T. Lahtonen:
Dense full-diversity matrix lattices for four transmit antenna MISO channel. ISIT 2005: 1290-1294 - 2004
- [c1]Jarkko Hiltunen, Camilla Hollanti, Jyrki T. Lahtonen:
Four antenna space-time lattice constellations from division algebras. ISIT 2004: 338
Coauthor Index
Ragnar Freij
aka: Ragnar Freij-Hollanti
aka: Ragnar Freij-Hollanti
Oliver W. Gnilke
aka: Oliver Wilhelm Gnilke
aka: Oliver Wilhelm Gnilke
Hsiao-feng Lu
aka: Hsiao-feng Francis Lu
aka: Hsiao-feng Francis Lu
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-12 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
