Camilla Hollanti

From MaRDI portal
Revision as of 08:55, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1623914

Available identifiers

zbMath Open hollanti.camilla-johannaWikidataQ63348661 ScholiaQ63348661MaRDI QIDQ1623914

List of research outcomes





PublicationDate of PublicationType
Euclidean lattices: theory and applications2024-08-28Paper
General framework for linear secure distributed matrix multiplication with Byzantine servers2024-07-23Paper
Toward the Capacity of Private Information Retrieval From Coded and Colluding Servers2022-02-17Paper
Even Unimodular Lattices from Quaternion Algebras2021-09-21Paper
Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels2021-07-23Paper
Dense generic well-rounded lattices2021-07-02Paper
Cyclic flats of binary matroids2021-04-23Paper
On fast-decodable algebraic space-time codes2021-03-22Paper
The complete hierarchical locality of the punctured simplex code2021-01-25Paper
An Approximation of Theta Functions with Applications to Communications2021-01-08Paper
Private Streaming With Convolutional Codes2020-09-29Paper
Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes2020-01-28Paper
$t$-private information retrieval schemes using transitive codes2019-07-19Paper
Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers2019-07-19Paper
Improved user-private information retrieval via finite geometry2019-02-20Paper
Natural orders for asymmetric space-time coding: minimizing the discriminant2018-11-15Paper
Density of Spherically Embedded Stiefel and Grassmann Codes2018-06-27Paper
On binary matroid minors and applications to data storage over small fields2018-03-16Paper
Private Information Retrieval from Coded Databases with Colluding Servers2018-02-14Paper
Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures2017-09-18Paper
Construction Methods for Asymmetric and Multiblock Space–Time Codes2017-08-08Paper
On the Densest MIMO Lattices From Cyclic Division Algebras2017-08-08Paper
Optimal Diversity–Multiplexing Tradeoff and Code Constructions of Some Constrained Asymmetric MIMO Systems2017-07-27Paper
Fast-Decodable Asymmetric Space-Time Codes From Division Algebras2017-07-12Paper
DMT Optimal Codes Constructions for Multiple-Access MIMO Channel2017-07-12Paper
On the Combinatorics of Locally Repairable Codes via Matroid Theory2017-04-28Paper
Constructions and Properties of Linear Locally Repairable Codes2017-04-28Paper
Matroid Theory and Storage Codes: Bounds and Constructions2017-04-13Paper
Bounds on the Maximal Minimum Distance of Linear Locally Repairable Codes2016-02-14Paper
Constructions of Fast-Decodable Distributed Space-Time Codes2016-01-07Paper
Probability estimates for fading and wiretap channels from ideal class zeta functions2015-11-25Paper
Fuchsian codes with arbitrarily high code rates2015-10-27Paper
Nonuniform Fuchsian codes for noisy channels2015-03-19Paper
Fast-Decodable Space-Time Codes for the $N$-Relay and Multiple-Access MIMO Channel2014-12-03Paper
Algebraic Codes and a New Physical Layer Transmission Protocol for Wireless Distributed Storage Systems2014-05-17Paper
Nonasymptotic Probability Bounds for Fading Channels Exploiting Dedekind Zeta Functions2013-03-14Paper
https://portal.mardi4nfdi.de/entity/Q28904812012-06-09Paper
Algebraic Fast-Decodable Relay Codes for Distributed Communications2012-02-27Paper
CYCLIC DIVISION ALGEBRAS IN SPACE-TIME CODING: A BRIEF OVERVIEW2010-06-17Paper
Maximal Orders in the Design of Dense Space-Time Lattice Codes2009-02-24Paper
Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes2008-04-17Paper
Euclidean lattices: theory and applicationsN/APaper
Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query AttackN/APaper

Research outcomes over time

This page was built for person: Camilla Hollanti