| Publication | Date of Publication | Type |
|---|
New constructions of cyclic constant-dimension subspace codes based on Sidon spaces and subspace polynomials
Designs, Codes and Cryptography | 2025-12-02 | Paper |
Multilevel inserting constructions for constant dimension subspace codes
Designs, Codes and Cryptography | 2025-12-01 | Paper |
Improved multi-access coded caching schemes from maximal cross resolvable designs
Advances in Mathematics of Communications | 2025-07-25 | Paper |
Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
Advances in Mathematics of Communications | 2023-09-12 | Paper |
| Relationships of bounds for sizes of subspace codes in singular linear spaces over finite fields. | 2022-02-22 | Paper |
| Relationships of bounds for sizes of subspace codes in singular linear spaces over finite fields. | 2021-12-10 | Paper |
Bounds on subspace codes based on subspaces of type (s,0,0,0) in pseudo-symplectic spaces and singular pseudo-symplectic spaces
Applied Mathematics and Computation | 2021-11-11 | Paper |
| The Jacobi sums over Galois rings of arbitrary characters and their applications in constructing asymptotically optimal codebooks | 2021-05-28 | Paper |
New construction of error-correcting pooling designs from singular linear spaces over finite fields
Journal of Combinatorial Optimization | 2021-05-11 | Paper |
Constructions of \((r,t)\)-LRC based on totally isotropic subspaces in symplectic space over finite fields
International Journal of Foundations of Computer Science | 2021-04-20 | Paper |
Welch bound-achieving compressed sensing matrices from optimal codebooks
Discrete Mathematics, Algorithms and Applications | 2021-03-18 | Paper |
Deterministic construction of compressed sensing matrices from constant dimension codes
Discrete Applied Mathematics | 2020-08-31 | Paper |
Generalized asymptotically optimal codebooks
Applied Mathematics and Computation | 2020-05-14 | Paper |
Bounds on subspace codes based on orthogonal space over finite fields of characteristic 2
International Journal of Foundations of Computer Science | 2019-12-10 | Paper |
Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes
Applied Mathematics and Computation | 2019-11-22 | Paper |
| The construction of orbit codes based on singular linear space over finite fields | 2019-11-19 | Paper |
Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space
Journal of Applied Mathematics | 2019-11-19 | Paper |
Two new constructions of approximately symmetric informationally complete positive operator-valued measures
International Journal of Quantum Information | 2019-11-06 | Paper |
Deterministic constructions of compressed sensing matrices based on codes
Cryptography and Communications | 2019-07-10 | Paper |
Subspace code based on flats in affine space over finite fields
Discrete Mathematics, Algorithms and Applications | 2019-01-09 | Paper |
Deterministic construction of compressed sensing matrices with characters over finite fields
Discrete Mathematics, Algorithms and Applications | 2018-11-14 | Paper |
Two new constructions of approximately mutually unbiased bases
International Journal of Quantum Information | 2018-09-03 | Paper |
Error-correcting codes in attenuated space over finite fields
Finite Fields and their Applications | 2017-08-03 | Paper |
Bounds on subspace codes based on totally isotropic subspaces in unitary spaces
Discrete Mathematics, Algorithms and Applications | 2016-12-14 | Paper |
\(q\)-analogs of covering designs and Steiner systems based on singular linear space
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2016-10-27 | Paper |
A Latin square autotopism secret sharing scheme
Designs, Codes and Cryptography | 2016-07-21 | Paper |
On computing the number of Latin rectangles
Graphs and Combinatorics | 2016-06-09 | Paper |
A new construction of multisender authentication codes with simultaneous model from singular symplectic geometry over finite fields.
Ars Combinatoria | 2016-05-04 | Paper |
