Subspace code based on flats in affine space over finite fields. - Min-Yao Niu; Gang Wang 035; You Gao; Fang-Wei Fu 001 (Discret. Math. Algorithms Appl., 2018)

Deterministic construction of compressed sensing matrices with characters over finite fields. - Gang Wang 035; Min-Yao Niu; Fang-Wei Fu 001 (Discret. Math. Algorithms Appl., 2018)

Deterministic Constructions of Compressed Sensing Matrices Based on Affine Singular Linear Space over Finite Fields. - Gang Wang 035; Min-Yao Niu; Jian Gao 001; Fang-Wei Fu 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes. - Gang Wang 035; Min-Yao Niu; Fang-Wei Fu 001 (Appl. Math. Comput., 2019)

Deterministic constructions of compressed sensing matrices based on codes. - Gang Wang 035; Min-Yao Niu; Fang-Wei Fu 001 (Cryptogr. Commun., 2019)

A Generalized Construction of Asymptotically Optimal Codebooks. - Gang Wang 035; Min-Yao Niu; You Gao; Fang-Wei Fu 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

A Generalized Construction of Codebook Asymptotically Meeting the Welch Bound. - Gang Wang 035; Min-Yao Niu; Jian Gao 001; Fang-Wei Fu 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2. - Gang Wang 035; Min-Yao Niu; Fang-Wei Fu 001 (Int. J. Found. Comput. Sci., 2019)

Subspace Codes Based on Partial Injective Maps of Vector Spaces Over Finite Fields. - Hong-Li Wang; Gang Wang 035; You Gao (IEEE Access, 2020)

Generalized asymptotically optimal codebooks. - Gang Wang 035; Min-Yao Niu; You Gao (Appl. Math. Comput., 2020)

Deterministic construction of compressed sensing matrices from constant dimension codes. - Gang Wang 035; Min-Yao Niu; Fang-Wei Fu 001 (Discret. Appl. Math., 2020)

Welch bound-achieving compressed sensing matrices from optimal codebooks. - Gang Wang 035; Min-Yao Niu; You Gao (Discret. Math. Algorithms Appl., 2020)

Asymptotically Optimal Codebooks in Regard to the Welch Bound with Characters. - Gang Wang 035; Min-Yao Niu; Lin-Zhi Shen 001; You Gao (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020)

Constructions of (r, t)-LRC Based on Totally Isotropic Subspaces in Symplectic Space Over Finite Fields. - Gang Wang 035; Min-Yao Niu; Fang-Wei Fu 001 (Int. J. Found. Comput. Sci., 2020)

Bounds on subspace codes based on subspaces of type (s, 0, 0, 0) in pseudo-sympletic spaces and singular pseudo-symplectic spaces. - You Gao; Jinru Gao; Gang Wang 035 (Appl. Math. Comput., 2021)

The Jacobi sums over Galois rings of arbitrary characters and their applications in constructing asymptotically optimal codebooks. - Deng-Ming Xu; Chen Meng; Gang Wang 035; Fang-Wei Fu 001 (CoRR, 2021)

New construction of error-correcting pooling designs from singular linear spaces over finite fields. - Gang Wang 035; You Gao (J. Comb. Optim., 2021)

Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound. - Gang Wang 035; Deng-Ming Xu; Fang-Wei Fu 001 (Adv. Math. Commun., 2023)

Jacobi sums over Galois rings of arbitrary characters and their applications in constructing asymptotically optimal codebooks. - Deng-Ming Xu; Gang Wang 035; Sihem Mesnager; You Gao; Fang-Wei Fu 001 (Des. Codes Cryptogr., 2024)

New constructions of approximately symmetric informationally complete positive operator-valued measures by character sums over Galois rings. - Gang Wang 035; You Gao; Ming-Yue Xie; Min-Yao Niu (Quantum Inf. Process., 2025)