The following pages link to Camilla Hollanti (Q1623914):
Displaying 32 items.
- (Q886962) (redirect page) (← links)
- Fuchsian codes with arbitrarily high code rates (Q886965) (← links)
- Probability estimates for fading and wiretap channels from ideal class zeta functions (Q894997) (← links)
- Natural orders for asymmetric space-time coding: minimizing the discriminant (Q1623915) (← links)
- On binary matroid minors and applications to data storage over small fields (Q1705519) (← links)
- Improved user-private information retrieval via finite geometry (Q1727378) (← links)
- Cyclic flats of binary matroids (Q2020048) (← links)
- The complete hierarchical locality of the punctured simplex code (Q2220763) (← links)
- Nonuniform Fuchsian codes for noisy channels (Q2263947) (← links)
- On fast-decodable algebraic space-time codes (Q2658390) (← links)
- (Q2890481) (← links)
- On the Combinatorics of Locally Repairable Codes via Matroid Theory (Q2976542) (← links)
- Constructions and Properties of Linear Locally Repairable Codes (Q2976948) (← links)
- An Approximation of Theta Functions with Applications to Communications (Q3388006) (← links)
- Constructions of Fast-Decodable Distributed Space-Time Codes (Q3460447) (← links)
- CYCLIC DIVISION ALGEBRAS IN SPACE-TIME CODING: A BRIEF OVERVIEW (Q3567870) (← links)
- Maximal Orders in the Design of Dense Space-Time Lattice Codes (Q3604896) (← links)
- Density of Spherically Embedded Stiefel and Grassmann Codes (Q4566629) (← links)
- Private Information Retrieval from Coded Databases with Colluding Servers (Q4603025) (← links)
- Construction Methods for Asymmetric and Multiblock Space–Time Codes (Q4975762) (← links)
- On the Densest MIMO Lattices From Cyclic Division Algebras (Q4975971) (← links)
- Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels (Q5001747) (← links)
- Toward the Capacity of Private Information Retrieval From Coded and Colluding Servers (Q5030302) (← links)
- Private Streaming With Convolutional Codes (Q5123865) (← links)
- Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes (Q5211429) (← links)
- $t$-private information retrieval schemes using transitive codes (Q5223919) (← links)
- Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers (Q5224041) (← links)
- Fast-Decodable Asymmetric Space-Time Codes From Division Algebras (Q5272019) (← links)
- DMT Optimal Codes Constructions for Multiple-Access MIMO Channel (Q5273615) (← links)
- Optimal Diversity–Multiplexing Tradeoff and Code Constructions of Some Constrained Asymmetric MIMO Systems (Q5281484) (← links)
- Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes (Q5386099) (← links)
- Euclidean lattices: theory and applications (Q6511114) (← links)
