| Publication | Date of Publication | Type |
|---|
| On Gaussian sampling for q-ary lattices and linear codes with Lee weight | 2026-02-04 | Paper |
Multilevel lattice codes from Hurwitz quaternion integers
IEEE Transactions on Information Theory | 2025-11-25 | Paper |
Unit reducible fields and perfect unary forms. II. Cyclotomic fields
Journal de Théorie des Nombres de Bordeaux | 2025-10-15 | Paper |
| On the spinor genus and the distinguishing lattice isomorphism problem | 2025-07-03 | Paper |
| Algebraic equipage for learning with errors in cyclic division algebras | 2025-04-15 | Paper |
A small serving of mash: (quantum) algorithms for SPDH-sign with small parameters
Journal of Mathematical Cryptology | 2025-04-15 | Paper |
Randomized iterative sampling decoding algorithm for large-scale MIMO detection
IEEE Transactions on Signal Processing | 2024-09-16 | Paper |
| Middle-products of skew polynomials and learning with errors | 2024-08-30 | Paper |
Optimal rate-limited secret key generation from Gaussian sources using lattices
IEEE Transactions on Information Theory | 2024-07-18 | Paper |
A new bound for the orthogonality defect of HKZ reduced lattices
Research in Number Theory | 2024-07-16 | Paper |
Fractional non-norm elements for division algebras, and an application to cyclic learning with errors
Advances in Mathematics of Communications | 2024-06-01 | Paper |
| NTRU in Quaternion Algebras of Bounded Discriminant | 2024-04-26 | Paper |
Unit reducible fields and perfect unary forms
Journal de Théorie des Nombres de Bordeaux | 2024-03-26 | Paper |
Subfield algorithms for ideal- and module-SVP based on the decomposition group
Banach Center Publications | 2024-03-15 | Paper |
| Unit Reducible Cyclotomic Fields | 2023-11-28 | Paper |
Polar coding for ring-LWE-based public key encryption
Cryptography and Communications | 2023-06-20 | Paper |
Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling
Designs, Codes and Cryptography | 2023-04-28 | Paper |
Lattice Reduction Over Imaginary Quadratic Fields
IEEE Transactions on Signal Processing | 2022-09-23 | Paper |
On Low-Complexity Lattice Reduction Algorithms for Large-Scale MIMO Detection: The Blessing of Sequential Reduction
IEEE Transactions on Signal Processing | 2022-09-23 | Paper |
| Lattice Codes for Lattice-Based PKE | 2022-08-28 | Paper |
| Wang Algebra: From Theory to Practice | 2022-08-20 | Paper |
| A New Bound for the Orthogonality Defect of HKZ Reduced Lattices | 2022-08-11 | Paper |
Non-commutative ring learning with errors from cyclic algebras
Journal of Cryptology | 2022-07-20 | Paper |
Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Secure Distributed Matrix Computation With Discrete Fourier Transform
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
| Reduction Theory of Algebraic Modules and their Successive Minima | 2021-11-12 | Paper |
Polar Lattices for Lossy Compression
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
| Random algebraic lattices and codes for wireless communications | 2021-03-22 | Paper |
Semantically Secure Lattice Codes for Compound MIMO Channels
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Secure Distributed Matrix Computation with Discrete Fourier Transform
(available as arXiv preprint) | 2020-07-08 | Paper |
Ring Compute-and-Forward Over Block-Fading Channels
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
On Low-complexity Lattice Reduction Algorithms for Large-scale MIMO Detection: the Blessing of Sequential Reduction
(available as arXiv preprint) | 2019-12-12 | Paper |
Coprime Sensing via Chinese Remaindering Over Quadratic Fields—Part I: Array Designs
IEEE Transactions on Signal Processing | 2019-10-28 | Paper |
Coprime Sensing via Chinese Remaindering Over Quadratic Fields—Part II: Generalizations and Applications
IEEE Transactions on Signal Processing | 2019-10-28 | Paper |
Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance Decoding and Trapdoor Sampling
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Corrections to “Achieving AWGN Channel Capacity With Lattice Gaussian Coding” [Oct 14 5918-5929]
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
| On the Optimality of Gauss's Algorithm over Euclidean Imaginary Quadratic Fields | 2019-04-10 | Paper |
AWGN-Goodness Is Enough: Capacity-Achieving Lattice Codes Based on Dithered Probabilistic Shaping
IEEE Transactions on Information Theory | 2019-03-28 | Paper |
Hybrid Vector Perturbation Precoding: The Blessing of Approximate Message Passing
IEEE Transactions on Signal Processing | 2019-03-06 | Paper |
Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing
IEEE Transactions on Signal Processing | 2019-02-12 | Paper |
Boosted KZ and LLL Algorithms
IEEE Transactions on Signal Processing | 2019-02-08 | Paper |
Universal Lattice Codes for MIMO Channels
IEEE Transactions on Information Theory | 2018-12-18 | Paper |
Almost Universal Codes for MIMO Wiretap Channels
IEEE Transactions on Information Theory | 2018-12-04 | Paper |
Convolutional Compressed Sensing Using Deterministic Sequences
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
Modulated Unit-Norm Tight Frames for Compressed Sensing
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
On the Proximity Factors of Lattice Reduction-Aided Decoding
IEEE Transactions on Signal Processing | 2018-07-18 | Paper |
Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection
IEEE Transactions on Signal Processing | 2018-07-09 | Paper |
On the Geometric Ergodicity of Metropolis-Hastings Algorithms for Lattice Gaussian Sampling
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Computation of the Para-Pseudoinverse for Oversampled Filter Banks: Forward and Backward Greville Formulas
IEEE Transactions on Signal Processing | 2018-06-27 | Paper |
Achieving Secrecy Capacity of the Gaussian Wiretap Channel With Polar Lattices
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Lattice Reduction over Imaginary Quadratic Fields
(available as arXiv preprint) | 2018-06-08 | Paper |
Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Decoding by Embedding: Correct Decoding Radius and DMT Optimality
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Semantically Secure Lattice Codes for the Gaussian Wiretap Channel
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Achieving AWGN Channel Capacity With Lattice Gaussian Coding
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
On the Diversity of Linear Transceivers in MIMO AF Relaying Systems
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
| Almost universal codes for fading wiretap channels | 2016-01-11 | Paper |
A back-iteration method for reconstructing chaotic sequences in finite-precision machines
Circuits, Systems, and Signal Processing | 2009-06-17 | Paper |
Performance of Space–Time Codes: Gallager Bounds and Weight Enumeration
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Noncoherent sequence detection of differential space-time modulation
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Gallager Bounds for Noncoherent Decoders in Fading Channels
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
New Gallager Bounds in Block-Fading Channels
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
