| Publication | Date of Publication | Type |
|---|
Quantum Latin squares with all possible cardinalities
Journal of Combinatorial Designs | 2026-08-13 | Paper |
New upper bounds for wide-sense frameproof codes
Designs, Codes and Cryptography | 2025-09-04 | Paper |
Constructions of optimal sparse r-disjunct matrices via packings
Journal of Combinatorial Designs | 2025-07-25 | Paper |
A tensor recommendation method based on HMM network and meta-path
Information Sciences | 2025-01-08 | Paper |
Adaptive fault-tolerant platooning control for nonlinear homogeneous multiple autonomous vehicles under unreliable communication networks
International Journal of Robust and Nonlinear Control | 2024-05-07 | Paper |
Covering Grassmannian Codes: Bounds and Constructions
IEEE Transactions on Information Theory | 2024-03-21 | Paper |
Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures
IEEE Transactions on Information Theory | 2024-03-19 | Paper |
A New Construction for Constant-Composition Codes
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
New Constructions of Optimal Locally Repairable Codes With Super-Linear Length
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
| Improved Lower Bounds for Secure Codes and Related Structures | 2021-08-18 | Paper |
New Bounds and Constructions for Constant Weighted <i>X</i>-Codes
IEEE Transactions on Information Theory | 2021-07-22 | Paper |
Improved upper bounds for parent-identifying set systems and separable codes
Designs, Codes and Cryptography | 2021-01-25 | Paper |
On Private Information Retrieval Array Codes
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Linear \((2, p, p)\)-AONTs exist for all primes \(p\)
Designs, Codes and Cryptography | 2019-09-12 | Paper |
Constructions of augmented orthogonal arrays
Journal of Combinatorial Designs | 2019-03-28 | Paper |
Some intriguing upper bounds for separating hash families
Science China. Mathematics | 2019-03-07 | Paper |
Asymptotically Optimal Optical Orthogonal Signature Pattern Codes
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
New Bounds for Frameproof Codes
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
Designs, Codes and Cryptography | 2017-10-27 | Paper |
A strengthened inequality of Alon-Babai-Suzuki's conjecture on set systems with restricted intersections modulo \(p\)
Discrete Mathematics | 2017-10-24 | Paper |
New Bounds and Constructions for Multiply Constant-Weight Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Invertible binary matrices with maximum number of 2-by-2 invertible submatrices
Discrete Mathematics | 2016-12-14 | Paper |
Deterministic convolutional compressed sensing matrices
Finite Fields and their Applications | 2016-10-10 | Paper |
