Four antenna space-time lattice constellations from division algebras. - Jarkko Hiltunen; Camilla Hollanti; Jyrki T. Lahtonen (ISIT, 2004)

Dense full-diversity matrix lattices for four transmit antenna MISO channel. - Jarkko Hiltunen; Camilla Hollanti; Jyrki T. Lahtonen (ISIT, 2005)

Optimal Matrix Lattices for MIMO Codes from Division Algebras. - Camilla Hollanti; Jyrki T. Lahtonen; Kalle Ranto; Roope Vehkalahti (ISIT, 2006)

A New Tool: Constructing STBCs from Maximal Orders in Central Simple Algebras. - Camilla Hollanti; Jyrki T. Lahtonen (ITW, 2006)

Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes. - Camilla Hollanti; Hsiao-feng Lu (AAECC, 2007)

On MIDO Space-Time Block Codes. - Camilla Hollanti; Kalle Ranto (ISIT, 2007)

Asymmetric Space-Time Block Codes for MIMO Systems. - Camilla Hollanti; Kalle Ranto (ITW, 2007)

Constructing asymmetric space-time codes with the Smart Puncturing Method. - Camilla Hollanti; Hsiao-feng Lu (ISIT, 2008)

On the construction of DMT-Optimal AST codes with transmit antenna selection. - Hsiao-feng Lu; Camilla Hollanti (ISIT, 2008)

On the algebraic structure of the Silver code: A 2 × 2 perfect space-time block code. - Camilla Hollanti; Jyrki T. Lahtonen; Kalle Ranto; Roope Vehkalahti; Emanuele Viterbo (ITW, 2008)

Maximal Orders in the Design of Dense Space-Time Lattice Codes. - Camilla Hollanti; Jyrki T. Lahtonen; Hsiao-feng Lu (IEEE Trans. Inf. Theory, 2008)

An algebraic tool for obtaining conditional non-vanishing determinants. - Camilla Hollanti; Roope Vehkalahti; Hsiao-feng Lu (ISIT, 2009)

Diversity-multiplexing tradeoff-optimal code constructions for symmetric MIMO multiple access channels. - Hsiao-feng Lu; Camilla Hollanti (ISIT, 2009)

On the Decay of the Determinants of Multiuser MIMO Lattice Codes - Jyrki T. Lahtonen; Roope Vehkalahti; Hsiao-feng Lu; Camilla Hollanti; Emanuele Viterbo (CoRR, 2009)

Remarks on the Criteria of Constructing MIMO-MAC DMT Optimal Codes - Hsiao-feng Lu; Jyrki T. Lahtonen; Roope Vehkalahti; Camilla Hollanti (CoRR, 2009)

New Space-Time Code Constructions for Two-User Multiple Access Channels. - Hsiao-feng Lu; Roope Vehkalahti; Camilla Hollanti; Jyrki T. Lahtonen; Yi Hong 001; Emanuele Viterbo (IEEE J. Sel. Top. Signal Process., 2009)

Construction Methods for Asymmetric and Multiblock Space-Time Codes. - Camilla Hollanti; Hsiao-feng Lu (IEEE Trans. Inf. Theory, 2009)

On the densest MIMO lattices from cyclic division algebras. - Roope Vehkalahti; Camilla Hollanti; Jyrki T. Lahtonen; Kalle Ranto (IEEE Trans. Inf. Theory, 2009)

Fast-decodable MIDO codes from crossed product algebras. - Frédérique E. Oggier; Roope Vehkalahti; Camilla Hollanti (ISIT, 2010)

A family of cyclic division algebra based fast-decodable 4×2 space-time block codes. - Roope Vehkalahti; Camilla Hollanti; Jyrki T. Lahtonen (ISITA, 2010)

Some simple observations on MISO codes. - Roope Vehkalahti; Camilla Hollanti; Jyrki T. Lahtonen; Hsiao-feng Lu (ISITA, 2010)

Optimal diversity-multiplexing tradeoff and code constructions of some constrained asymmetric MIMO systems. - Hsiao-feng Lu; Camilla Hollanti (IEEE Trans. Inf. Theory, 2010)

Analysis on wiretap lattice codes and probability bounds from Dedekind zeta functions. - Camilla Hollanti; Emanuele Viterbo (ICUMT, 2011)

A general framework for constructing fast-decodable asymmetric space-time codes. - Roope Vehkalahti; Camilla Hollanti (ISIT, 2011)

On the eavesdropper's correct decision in Gaussian and fading wiretap channels using lattice codes. - Anne-Maria Ernvall-Hytönen; Camilla Hollanti (ITW, 2011)

Reducing complexity with less than minimum delay space-time lattice codes. - Roope Vehkalahti; Camilla Hollanti (ITW, 2011)

Algebraic hybrid satellite-terrestrial space-time codes for digital broadcasting in SFN. - Camilla Hollanti; Roope Vehkalahti; Youssef Nasser (SiPS, 2011)

DMT Optimal Codes Constructions for Multiple-Access MIMO Channel. - Hsiao-feng Lu; Camilla Hollanti; Roope Vehkalahti; Jyrki T. Lahtonen (IEEE Trans. Inf. Theory, 2011)

Algebraic fast-decodable relay codes for distributed communications. - Camilla Hollanti; Nadya Markin (ISIT, 2012)

Distributed storage for proximity based services. - Joonas Pääkkönen; K. D. Prathapasinghe Dharmawansa; Camilla Hollanti; Olav Tirkkonen (Swe-CTW, 2012)

Fast-Decodable Asymmetric Space-Time Codes From Division Algebras. - Roope Vehkalahti; Camilla Hollanti; Frédérique E. Oggier (IEEE Trans. Inf. Theory, 2012)

Device-to-device data storage for mobile cellular systems. - Joonas Pääkkönen; Camilla Hollanti; Olav Tirkkonen (GLOBECOM Workshops, 2013)

Probability bounds for an eavesdropper's correct decision over a MIMO wiretap channel. - David A. Karpuk; Iván Blanco-Chacón; Camilla Hollanti (ISIT, 2013)

Fuchsian codes for AWGN channels. - Iván Blanco-Chacón; Dionís Remón; Camilla Hollanti; Montserrat Alsina (CoRR, 2013)

Nonasymptotic Probability Bounds for Fading Channels Exploiting Dedekind Zeta Functions - Camilla Hollanti; Emanuele Viterbo; David A. Karpuk (CoRR, 2013)

Capacity and Security of Heterogeneous Distributed Storage Systems. - Toni Ernvall; Salim El Rouayheb; Camilla Hollanti; H. Vincent Poor (IEEE J. Sel. Areas Commun., 2013)

Rotating non-uniform and high-dimensional constellations using geodesic flow on lie groups. - David A. Karpuk; Camilla Hollanti (ICC, 2014)

Strong secrecy in wireless network coding systems with M-QAM modulators. - Arsenia Chorti; Mehdi M. Molu; David A. Karpuk; Camilla Hollanti; Alister G. Burr (ICCC, 2014)

Constructions of Fast-Decodable Distributed Space-Time Codes. - Amaro Barreal; Camilla Hollanti; Nadya Markin (ICMCTA, 2014)

Secrecy capacity of heterogeneous distributed storage systems. - Toni Ernvall; Salim El Rouayheb; Camilla Hollanti; H. Vincent Poor (ISCCSP, 2014)

New relay-based transmission protocols for wireless distributed storage systems. - Camilla Hollanti; Hsiao-feng Lu; David A. Karpuk; Amaro Barreal (ISITA, 2014)

Node repair for distributed storage systems over fading channels. - David A. Karpuk; Camilla Hollanti; Amaro Barreal (ISITA, 2014)

Multi-dimensional and non-uniform constellation optimization via the special orthogonal group. - David A. Karpuk; Camilla Hollanti (ITW, 2014)

Almost affine locally repairable codes and matroid theory. - Thomas Westerbäck; Toni Ernvall; Camilla Hollanti (ITW, 2014)

Constructions of optimal and almost optimal locally repairable codes. - Toni Ernvall; Thomas Westerbäck; Camilla Hollanti (VITAE, 2014)

Space-time storage codes for wireless distributed storage systems. - Camilla Hollanti; David A. Karpuk; Amaro Barreal; Hsiao-feng Francis Lu (VITAE, 2014)

Algebraic Codes and a New Physical Layer Transmission Protocol for Wireless Distributed Storage Systems. - Amaro Barreal; Camilla Hollanti; David A. Karpuk; Hsiao-feng Lu (CoRR, 2014)

Fuchsian codes with arbitrarily high code rate. - Iván Blanco-Chacón; Camilla Hollanti; Montserrat Alsina; Dionís Remón (CoRR, 2014)

Linear Locally Repairable Codes with Random Matrices. - Toni Ernvall; Thomas Westerbäck; Camilla Hollanti (CoRR, 2014)

Nonuniform Fuchsian codes for noisy channels. - Iván Blanco-Chacón; Dionís Remón; Camilla Hollanti; Montserrat Alsina (J. Frankl. Inst., 2014)

Applications of polymatroid theory to distributed storage systems. - Thomas Westerbäck; Ragnar Freij-Hollanti; Camilla Hollanti (Allerton, 2015)

A low-complexity message recovery method for Compute-and-Forward relaying. - Amaro Barreal; Joonas Pääkkönen; David A. Karpuk; Camilla Hollanti; Olav Tirkkonen (ITW Fall, 2015)

A comparison of skewed and orthogonal lattices in Gaussian wiretap channels. - Alex Karrila; Camilla Hollanti (ITW, 2015)

Device-to-Device Data Storage with Regenerating Codes. - Joonas Pääkkönen; Camilla Hollanti; Olav Tirkkonen (MACOM, 2015)

Probability estimates for fading and wiretap channels from ideal class zeta functions. - David A. Karpuk; Anne-Maria Ernvall-Hytönen; Camilla Hollanti; Emanuele Viterbo (Adv. Math. Commun., 2015)

Reduced Complexity Decoding of n x n Algebraic Space-Time Codes. - Amaro Barreal; Camilla Hollanti; David A. Karpuk (CoRR, 2015)

A connection between locally repairable codes and exact regenerating codes. - Toni Ernvall; Thomas Westerbäck; Ragnar Freij-Hollanti; Camilla Hollanti (ISIT, 2016)

Bounds on the maximal minimum distance of linear locally repairable codes. - Antti Pöllänen; Thomas Westerbäck; Ragnar Freij-Hollanti; Camilla Hollanti (ISIT, 2016)

Information bounds and flatness factor approximation for fading wiretap MIMO channels. - Amaro Barreal; Alex Karrila; David A. Karpuk; Camilla Hollanti (ITNAC, 2016)

Well-rounded lattices for coset coding in MIMO wiretap channels. - Oliver W. Gnilke; Amaro Barreal; Alex Karrila; Ha Thanh Nguyen Tran; David A. Karpuk; Camilla Hollanti (ITNAC, 2016)

Well-rounded lattices for reliability and security in Rayleigh fading SISO channels. - Oliver Wilhelm Gnilke; Ha Thanh Nguyen Tran; Alex Karrila; Camilla Hollanti (ITW, 2016)

CONDENSE: A Reconfigurable Knowledge Acquisition Architecture for Future 5G IoT. - Dejan Vukobratovic; Dusan Jakovetic; Vitaly Skachek; Dragana Bajovic; Dino Sejdinovic; Günes Karabulut-Kurt; Camilla Hollanti; Ingo Fischer (IEEE Access, 2016)

Decoding in Compute-and-Forward Relaying: Real Lattices and the Flatness of Lattice Sums. - Amaro Barreal; David A. Karpuk; Camilla Hollanti (CoRR, 2016)

Nested Lattice Codes for Vector Perturbation Systems. - David A. Karpuk; Amaro Barreal; Oliver W. Gnilke; Camilla Hollanti (CoRR, 2016)

Information Bounds and Flatness Factor Approximation for Fading Wiretap Channels. - Alex Karrila; Amaro Barreal; David A. Karpuk; Camilla Hollanti (CoRR, 2016)

On Analytical and Geometric Lattice Design Criteria for Wiretap Coset Codes. - Alex Karrila; David A. Karpuk; Camilla Hollanti (CoRR, 2016)

Improved Singleton-type Bounds for Locally Repairable Codes. - Antti Pöllänen; Thomas Westerbäck; Ragnar Freij-Hollanti; Camilla Hollanti (CoRR, 2016)

Efficiently sphere-decodable physical layer transmission schemes for wireless storage networks. - Hsiao-feng Francis Lu; Amaro Barreal; David A. Karpuk; Camilla Hollanti (EURASIP J. Adv. Signal Process., 2016)

Constructions and Properties of Linear Locally Repairable Codes. - Toni Ernvall; Thomas Westerbäck; Ragnar Freij-Hollanti; Camilla Hollanti (IEEE Trans. Inf. Theory, 2016)

On the Combinatorics of Locally Repairable Codes via Matroid Theory. - Thomas Westerbäck; Ragnar Freij-Hollanti; Toni Ernvall; Camilla Hollanti (IEEE Trans. Inf. Theory, 2016)

Fast-Decodable Space-Time Codes for the N-Relay and Multiple-Access MIMO Channel. - Amaro Barreal; Camilla Hollanti; Nadya Markin (IEEE Trans. Wirel. Commun., 2016)

Locally Diverse Constellations From the Special Orthogonal Group. - David A. Karpuk; Camilla Hollanti (IEEE Trans. Wirel. Commun., 2016)

On Binary Matroid Minors and Applications to Data Storage over Small Fields. - Matthias Grezet; Ragnar Freij-Hollanti; Thomas Westerbäck; Camilla Hollanti (ICMCTA, 2017)

Lattice coding for Rician fading channels from Hadamard rotations. - Alex Karrila; Niko R. Väisänen; David A. Karpuk; Camilla Hollanti (ISIT, 2017)

Private information retrieval schemes for codec data with arbitrary collusion patterns. - Razan Tajeddine; Oliver W. Gnilke; David A. Karpuk; Ragnar Freij-Hollanti; Camilla Hollanti; Salim El Rouayheb (ISIT, 2017)

Matroid Theory and Storage Codes: Bounds and Constructions. - Ragnar Freij-Hollanti; Camilla Hollanti; Thomas Westerbäck (CoRR, 2017)

Traffic Minimizing Caching and Latent Variable Distributions of Order Statistics. - Joonas Pääkkönen; K. D. Prathapasinghe Dharmawansa; Ragnar Freij-Hollanti; Camilla Hollanti; Olav Tirkkonen (CoRR, 2017)

Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns. - Razan Tajeddine; Oliver W. Gnilke; David A. Karpuk; Ragnar Freij-Hollanti; Camilla Hollanti; Salim El Rouayheb (CoRR, 2017)

Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures. - Matthias Grezet; Ragnar Freij-Hollanti; Thomas Westerbäck; Oktay Olmez; Camilla Hollanti (CoRR, 2017)

On Fast-Decodable Algebraic Space-Time Codes. - Amaro Barreal; Camilla Hollanti (CoRR, 2017)

Special issue on network coding. - Francisco A. Monteiro; Alister G. Burr; Ioannis Chatzigeorgiou; Camilla Hollanti; Ioannis Krikidis; Hulya Seferoglu; Vitaly Skachek (EURASIP J. Adv. Signal Process., 2017)

Private Information Retrieval from Coded Databases with Colluding Servers. - Ragnar Freij-Hollanti; Oliver W. Gnilke; Camilla Hollanti; David A. Karpuk (SIAM J. Appl. Algebra Geom., 2017)

Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers. - Razan Tajeddine; Oliver W. Gnilke; David A. Karpuk; Ragnar Freij-Hollanti; Camilla Hollanti (ISIT, 2018)

Analysis of Some Well-Rounded Lattices in Wiretap Channels. - Mohamed Taoufiq Damir; Oliver W. Gnilke; Laia Amorós; Camilla Hollanti (SPAWC, 2018)

Natural orders for asymmetric space-time coding: minimizing the discriminant. - Amaro Barreal; Capi Corrales Rodrigáñez; Camilla Hollanti (Appl. Algebra Eng. Commun. Comput., 2018)

Private Information Retrieval over Networks. - Razan Tajeddine; Antonia Wachter-Zeh; Camilla Hollanti (CoRR, 2018)

Private Information Retrieval Schemes with Regenerating Codes. - Julien Lavauzelle; Razane Tajeddine; Ragnar Freij-Hollanti; Camilla Hollanti (CoRR, 2018)

Preface to the special issue on network coding and designs. - Simon R. Blackburn; Marcus Greferath; Camilla Hollanti; Mario-Osvin Pavcevic; Joachim Rosenthal; Leo Storme; Ángeles Vázquez-Castro; Alfred Wassermann (Des. Codes Cryptogr., 2018)

Density of Spherically Embedded Stiefel and Grassmann Codes. - Renaud-Alexandre Pitaval; Lu Wei 001; Olav Tirkkonen; Camilla Hollanti (IEEE Trans. Inf. Theory, 2018)

On the Capacity of Private Information Retrieval from Coded, Colluding, and Adversarial Servers. - Lukas Holzbaur; Ragnar Freij-Hollanti; Camilla Hollanti (ITW, 2019)

File Size Distributions and Caching for Offloading. - Joonas Pääkkönen; Prathapasinghe Dharmawansa; Ragnar Freij-Hollanti; Camilla Hollanti; Olav Tirkkonen (SPAWC, 2019)

Private Information Retrieval from MDS Array Codes with (Near-) Optimal Repair Bandwidth. - Jie Li 019; David A. Karpuk; Camilla Hollanti (CoRR, 2019)

Improved user-private information retrieval via finite geometry. - Oliver W. Gnilke; Marcus Greferath; Camilla Hollanti; Guillermo Nuñez Ponasso; Padraig Ó Catháin; Eric Swartz (Des. Codes Cryptogr., 2019)

Uniform Minors in Maximally Recoverable Codes. - Matthias Grezet; Thomas Westerbäck; Ragnar Freij-Hollanti; Camilla Hollanti (IEEE Commun. Lett., 2019)

$t$ -Private Information Retrieval Schemes Using Transitive Codes. - Ragnar Freij-Hollanti; Oliver W. Gnilke; Camilla Hollanti; Anna-Lena Horlemann-Trautmann; David A. Karpuk; Ivo Kubjas (IEEE Trans. Inf. Theory, 2019)

Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes. - Matthias Grezet; Ragnar Freij-Hollanti; Thomas Westerbäck; Camilla Hollanti (IEEE Trans. Inf. Theory, 2019)

Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers. - Razane Tajeddine; Oliver W. Gnilke; David A. Karpuk; Ragnar Freij-Hollanti; Camilla Hollanti (IEEE Trans. Inf. Theory, 2019)

Coded Caching Clusters with Device-to-Device Communications. - Joonas Pääkkönen; Amaro Barreal; Camilla Hollanti; Olav Tirkkonen (IEEE Trans. Mob. Comput., 2019)

Quantum Private Information Retrieval from MDS-coded and Colluding Servers. - Matteo Allaix; Lukas Holzbaur; Tefjol Pllaha; Camilla Hollanti (ISIT, 2020)

Computational Code-Based Single-Server Private Information Retrieval. - Lukas Holzbaur; Camilla Hollanti; Antonia Wachter-Zeh (ISIT, 2020)

Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power. - Julian Renner; Sven Puchinger; Antonia Wachter-Zeh; Camilla Hollanti; Ragnar Freij-Hollanti (ISIT, 2020)

Quantum Private Information Retrieval From Coded and Colluding Servers. - Matteo Allaix; Lukas Holzbaur; Tefjol Pllaha; Camilla Hollanti (IEEE J. Sel. Areas Inf. Theory, 2020)

An Approximation of Theta Functions with Applications to Communications. - Amaro Barreal; Mohamed Taoufiq Damir; Ragnar Freij-Hollanti; Camilla Hollanti (SIAM J. Appl. Algebra Geom., 2020)

Towards Practical Private Information Retrieval From MDS Array Codes. - Jie Li 019; David A. Karpuk; Camilla Hollanti (IEEE Trans. Commun., 2020)

Private Information Retrieval Over Random Linear Networks. - Razane Tajeddine; Antonia Wachter-Zeh; Camilla Hollanti (IEEE Trans. Inf. Forensics Secur., 2020)

Private Streaming With Convolutional Codes. - Lukas Holzbaur; Ragnar Freij-Hollanti; Antonia Wachter-Zeh; Camilla Hollanti (IEEE Trans. Inf. Theory, 2020)

High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes. - Matteo Allaix; Lukas Holzbaur; Tefjol Pllaha; Camilla Hollanti (ISIT, 2021)

Improved Private and Secure Distributed Matrix Multiplication. - Jie Li 019; Camilla Hollanti (ISIT, 2021)

Cyclic flats of binary matroids. - Ragnar Freij-Hollanti; Matthias Grezet; Camilla Hollanti; Thomas Westerbäck (Adv. Appl. Math., 2021)

Efficient Recovery of a Shared Secret via Cooperation: Applications to SDMM and PIR. - Jie Li 019; Camilla Hollanti; Oliver W. Gnilke (CoRR, 2021)

Improved Private and Secure Distributed (Batch) Matrix Multiplication. - Jie Li 019; Camilla Hollanti (CoRR, 2021)

The complete hierarchical locality of the punctured Simplex code. - Matthias Grezet; Camilla Hollanti (Des. Codes Cryptogr., 2021)

Private Information Retrieval Schemes With Product-Matrix MBR Codes. - Julien Lavauzelle; Razane Tajeddine; Ragnar Freij-Hollanti; Camilla Hollanti (IEEE Trans. Inf. Forensics Secur., 2021)

Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels. - Mohamed Taoufiq Damir; Alex Karrila; Laia Amorós; Oliver W. Gnilke; David A. Karpuk; Camilla Hollanti (IEEE Trans. Inf. Theory, 2021)

Analog Secure Distributed Matrix Multiplication over Complex Numbers. - Okko Makkonen; Camilla Hollanti (ISIT, 2022)

Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes. - Perttu Saarela; Matteo Allaix; Ragnar Freij-Hollanti; Camilla Hollanti (ISIT, 2022)

On the Capacity of Quantum Private Information Retrieval From MDS-Coded and Colluding Servers. - Matteo Allaix; Seunghoan Song; Lukas Holzbaur; Tefjol Pllaha; Masahito Hayashi; Camilla Hollanti (IEEE J. Sel. Areas Commun., 2022)

Efficient Recovery of a Shared Secret via Cooperation: Applications to SDMM and PIR. - Jie Li 019; Okko Makkonen; Camilla Hollanti; Oliver W. Gnilke (IEEE J. Sel. Areas Commun., 2022)

A Generic Transformation for Optimal Node Repair in MDS Array Codes Over F2. - Jie Li 019; Xiaohu Tang; Camilla Hollanti (IEEE Trans. Commun., 2022)

Private and Secure Distributed Matrix Multiplication Schemes for Replicated or MDS-Coded Servers. - Jie Li 019; Camilla Hollanti (IEEE Trans. Inf. Forensics Secur., 2022)

Toward the Capacity of Private Information Retrieval From Coded and Colluding Servers. - Lukas Holzbaur; Ragnar Freij-Hollanti; Jie Li 019; Camilla Hollanti (IEEE Trans. Inf. Theory, 2022)

Secure Distributed Gram Matrix Multiplication. - Okko Makkonen; Camilla Hollanti (ITW, 2023)

Euclidean lattices: theory and applications. - Lenny Fukshansky; Camilla Hollanti (CoRR, 2023)

Approximate Gradient Coding for Privacy-Flexible Federated Learning with Non-IID Data. - Okko Makkonen; Sampo Niemelä; Camilla Hollanti; Serge Kas Hanna (EUSIPCO, 2024)

Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval. - Okko Makkonen; David A. Karpuk; Camilla Hollanti (ISIT, 2024)

Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack. - Neehar Verma; Camilla Hollanti (ISIT, 2024)

Secret Sharing for Secure and Private Information Retrieval: A Construction Using Algebraic Geometry Codes. - Okko Makkonen; David A. Karpuk; Camilla Hollanti (CoRR, 2024)

Fast Multiplication and the PLWE-RLWE Equivalence for an Infinite Family of Cyclotomic Subextensions. - Joonas Ahola; Iván Blanco-Chacón; Wilmar Bolaños; Antti Haavikko; Camilla Hollanti; Rodrigo Martín Sánchez-Ledesma (IACR Cryptol. ePrint Arch., 2024)

General Framework for Linear Secure Distributed Matrix Multiplication With Byzantine Servers. - Okko Makkonen; Camilla Hollanti (IEEE Trans. Inf. Theory, 2024)

Dense Generic Well-Rounded Lattices. - Camilla Hollanti; Guillermo Mantilla-Soler; Niklas Miller (SIAM J. Appl. Algebra Geom., 2025)

N-Sum Box: An Abstraction for Linear Computation Over Many-to-One Quantum Networks. - Matteo Allaix; Yuxiang Lu; Yuhang Yao; Tefjol Pllaha; Camilla Hollanti; Syed Ali Jafar (IEEE Trans. Inf. Theory, 2025)

Function-Correcting Codes for Locally Bounded Functions. - Charul Rajput; B. Sundar Rajan; Ragnar Freij-Hollanti; Camilla Hollanti (CoRR, 2025)

Secret Sharing in the Rank Metric. - Johan V. Dinesen; Eimear Byrne; Ragnar Freij-Hollanti; Camilla Hollanti (CoRR, 2025)

Algebraic Geometry Codes for Secure Distributed Matrix Multiplication. - Okko Makkonen; Elif Saçikara; Camilla Hollanti (IEEE Trans. Inf. Theory, 2025)

CB-cPIR: Code-Based Computational Private Information Retrieval. - Camilla Hollanti; Neehar Verma (CoRR, 2025)

Fast multiplication and the PLWE-RLWE equivalence for an infinite family of maximal real subfields of cyclotomic fields. - Joonas Ahola; Iván Blanco-Chacón; Wilmar Bolaños; Antti Haavikko; Camilla Hollanti; Rodrigo Martín Sánchez-Ledesma (Des. Codes Cryptogr., 2025)