| Publication | Date of Publication | Type |
|---|
Fast multiplication and the PLWE-RLWE equivalence for an infinite family of maximal real subfields of cyclotomic fields
Designs, Codes and Cryptography | 2025-09-04 | Paper |
Euclidean lattices: theory and applications
Communications in Mathematics | 2024-08-28 | Paper |
General framework for linear secure distributed matrix multiplication with Byzantine servers
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Toward the Capacity of Private Information Retrieval From Coded and Colluding Servers
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
| Even Unimodular Lattices from Quaternion Algebras | 2021-09-21 | Paper |
Well-Rounded Lattices: Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
| Dense generic well-rounded lattices | 2021-07-02 | Paper |
Cyclic flats of binary matroids
Advances in Applied Mathematics | 2021-04-23 | Paper |
On fast-decodable algebraic space-time codes
(available as arXiv preprint) | 2021-03-22 | Paper |
The complete hierarchical locality of the punctured simplex code
Designs, Codes and Cryptography | 2021-01-25 | Paper |
An Approximation of Theta Functions with Applications to Communications
SIAM Journal on Applied Algebra and Geometry | 2021-01-08 | Paper |
Private Streaming With Convolutional Codes
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
$t$-private information retrieval schemes using transitive codes
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Private Information Retrieval From Coded Storage Systems With Colluding, Byzantine, and Unresponsive Servers
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Improved user-private information retrieval via finite geometry
Designs, Codes and Cryptography | 2019-02-20 | Paper |
Natural orders for asymmetric space-time coding: minimizing the discriminant
Applicable Algebra in Engineering, Communication and Computing | 2018-11-15 | Paper |
Density of Spherically Embedded Stiefel and Grassmann Codes
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
On binary matroid minors and applications to data storage over small fields
(available as arXiv preprint) | 2018-03-16 | Paper |
Private information retrieval from coded databases with colluding servers
SIAM Journal on Applied Algebra and Geometry | 2018-02-14 | Paper |
| Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures | 2017-09-18 | Paper |
Construction Methods for Asymmetric and Multiblock Space–Time Codes
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
On the Densest MIMO Lattices From Cyclic Division Algebras
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Optimal Diversity–Multiplexing Tradeoff and Code Constructions of Some Constrained Asymmetric MIMO Systems
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Fast-Decodable Asymmetric Space-Time Codes From Division Algebras
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
DMT Optimal Codes Constructions for Multiple-Access MIMO Channel
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
On the Combinatorics of Locally Repairable Codes via Matroid Theory
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Constructions and Properties of Linear Locally Repairable Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
| Matroid Theory and Storage Codes: Bounds and Constructions | 2017-04-13 | Paper |
| Bounds on the Maximal Minimum Distance of Linear Locally Repairable Codes | 2016-02-14 | Paper |
Constructions of fast-decodable distributed space-time codes
Coding Theory and Applications | 2016-01-07 | Paper |
Probability estimates for fading and wiretap channels from ideal class zeta functions
Advances in Mathematics of Communications | 2015-11-25 | Paper |
Fuchsian codes with arbitrarily high code rates
Journal of Pure and Applied Algebra | 2015-10-27 | Paper |
Fuchsian codes with arbitrarily high code rates
Journal of Pure and Applied Algebra | 2015-10-27 | Paper |
Nonuniform Fuchsian codes for noisy channels
Journal of the Franklin Institute | 2015-03-19 | Paper |
| Fast-Decodable Space-Time Codes for the $N$-Relay and Multiple-Access MIMO Channel | 2014-12-03 | Paper |
| Algebraic Codes and a New Physical Layer Transmission Protocol for Wireless Distributed Storage Systems | 2014-05-17 | Paper |
| Nonasymptotic Probability Bounds for Fading Channels Exploiting Dedekind Zeta Functions | 2013-03-14 | Paper |
Time, space and algebras in information transfer
Arkhimedes | 2012-06-09 | Paper |
| Algebraic Fast-Decodable Relay Codes for Distributed Communications | 2012-02-27 | Paper |
Cyclic division algebras in space-time coding: a brief overview
European Women in Mathematics | 2010-06-17 | Paper |
Maximal Orders in the Design of Dense Space-Time Lattice Codes
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes | 2008-04-17 | Paper |
Euclidean lattices: theory and applications
(available as arXiv preprint) | N/A | Paper |
Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack
(available as arXiv preprint) | N/A | Paper |
