| Publication | Date of Publication | Type |
|---|
Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Explicit cyclic and quasi-cyclic codes with optimal, best known parameters, and large relative minimum distances
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
| Two-round perfectly secure message transmission with optimal transmission rate | 2024-11-22 | Paper |
| List decoding of rank-metric codes with row-to-column ratio bigger than 1/2 | 2024-11-14 | Paper |
| Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery | 2024-11-14 | Paper |
| Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE | 2024-08-30 | Paper |
| Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications | 2024-08-30 | Paper |
| Ramp hyper-invertible matrices and their applications to MPC protocols | 2024-08-30 | Paper |
Threshold rates of code ensembles: linear is best
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Evolving secret sharing schemes based on polynomial evaluations and algebraic geometry codes
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
Constructions of \(k\)-uniform states in heterogeneous systems
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
| Threshold rates of code ensembles: linear is best | 2024-06-24 | Paper |
Full analysis of the scalar-induced gravitational waves for the curvature perturbation with local-type non-Gaussianities
Journal of Cosmology and Astroparticle Physics | 2024-05-06 | Paper |
| scientific article; zbMATH DE number 7788341 (Why is no real title available?) | 2024-01-15 | Paper |
Beating the probabilistic lower bound on \(q\)-perfect hashing
Combinatorica | 2023-10-04 | Paper |
| Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes | 2023-09-04 | Paper |
Dynamics of a periodic benthic-drift model for two species competition
Journal of Mathematical Analysis and Applications | 2023-07-06 | Paper |
More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
Advances in Cryptology – CRYPTO 2022 | 2023-06-12 | Paper |
On the interaction between ultralight bosons and quantum-corrected black holes
Journal of Cosmology and Astroparticle Physics | 2023-06-05 | Paper |
| Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) | 2023-03-29 | Paper |
The maximal rates and minimal decoding delay of more general complex orthogonal designs
Science China Information Sciences | 2022-10-28 | Paper |
| Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery | 2022-10-14 | Paper |
scientific article; zbMATH DE number 7561591 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Construction of Optimal (r, δ)-Locally Recoverable Codes and Connection With Graph Theory
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
| Robust secret sharing with almost optimal share size and security against rushing adversaries | 2022-03-23 | Paper |
| On the complexity of arithmetic secret sharing | 2022-03-23 | Paper |
Explicit-form complex orthogonal design for space-time block codes
Science China Information Sciences | 2021-12-15 | Paper |
Gravitational waves induced by the local-type non-Gaussian curvature perturbations
Physics Letters B | 2021-10-26 | Paper |
| scientific article; zbMATH DE number 7378653 (Why is no real title available?) | 2021-08-04 | Paper |
| Improved building blocks for secure multi-party computation based on secret sharing with honest majority | 2021-02-23 | Paper |
| Amortized complexity of information-theoretically secure MPC revisited | 2020-06-30 | Paper |
| Subspace designs based on algebraic function fields | 2020-05-27 | Paper |
| Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings | 2020-04-30 | Paper |
| Towards optimal robust secret sharing with security against a rushing adversary | 2020-02-04 | Paper |
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Asymptotic Gilbert–Varshamov Bound on Frequency Hopping Sequences
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
| Relationships between completeness of fuzzy quasi-uniform spaces | 2019-10-29 | Paper |
| Relationships between completeness of fuzzy quasi-uniform spaces | 2019-10-02 | Paper |
List Decodability of Symbol-Pair Codes
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
How Long Can Optimal Locally Repairable Codes Be?
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
IEEE Transactions on Information Theory | 2019-01-28 | Paper |
Construction of optimal locally recoverable codes and connection with hypergraph
(available as arXiv preprint) | 2018-11-22 | Paper |
Subspace designs based on algebraic function fields
Transactions of the American Mathematical Society | 2018-10-18 | Paper |
Subspace designs based on algebraic function fields
Transactions of the American Mathematical Society | 2018-10-18 | Paper |
A New Class of Rank-Metric Codes and Their List Decoding Beyond the Unique Decoding Radius
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
List Decoding of Cover Metric Codes Up to the Singleton Bound
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Multipartite entangled states, symmetric matrices and error-correcting codes
IEEE Transactions on Information Theory | 2017-11-10 | Paper |
| Co-Optimization Scheme for Distributed Energy Resource Planning in Community Microgrids | 2017-08-03 | Paper |
| Modified Viterbi Algorithm Based Distribution System Restoration Strategy for Grid Resiliency | 2017-08-03 | Paper |
| Economic Power Capacity Design of Distributed Energy Resources for Reliable Community Microgrids | 2017-08-03 | Paper |
| Economic Sizing of Distributed Energy Resources for Reliable Community Microgrids | 2017-08-03 | Paper |
Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack
Lecture Notes in Computer Science | 2017-06-13 | Paper |
List Decodability of Random Subcodes of Gabidulin Codes
IEEE Transactions on Information Theory | 2017-05-02 | Paper |
On the security of two identity-based signature schemes based on pairings
Information Processing Letters | 2016-04-06 | Paper |
Probabilistic autoreductions
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Revisiting a randomized algorithm for the minimum rainbow subgraph problem
Theoretical Computer Science | 2015-10-08 | Paper |
A refined analysis on the jump number problem of interval orders
Information Processing Letters | 2015-07-15 | Paper |
Computing on binary strings
Theoretical Computer Science | 2014-12-02 | Paper |
A note on sparse solutions of sparse linear systems
Theoretical Computer Science | 2014-09-10 | Paper |
A construction method of matroidal networks
Science China Information Sciences | 2013-08-20 | Paper |
Holographic reduction for some counting problems
Information Processing Letters | 2013-04-04 | Paper |
A characterization of solvability for a class of networks
Science China Information Sciences | 2012-08-17 | Paper |
A novel elementary construction of matching vectors
Information Processing Letters | 2012-07-25 | Paper |
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
(available as arXiv preprint) | N/A | Paper |
