Gang Wang
Orcid: 0000-0003-2868-4195Affiliations:
- Nankai University, Chern Institute of Mathematics and LPMC, China
According to our database1,
Gang Wang
authored at least 19 papers
between 2018 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Jacobi sums over Galois rings of arbitrary characters and their applications in constructing asymptotically optimal codebooks.
Des. Codes Cryptogr., April, 2024
2023
Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound.
Adv. Math. Commun., 2023
2021
New construction of error-correcting pooling designs from singular linear spaces over finite fields.
J. Comb. Optim., 2021
The Jacobi sums over Galois rings of arbitrary characters and their applications in constructing asymptotically optimal codebooks.
CoRR, 2021
Bounds on subspace codes based on subspaces of type (s, 0, 0, 0) in pseudo-sympletic spaces and singular pseudo-symplectic spaces.
Appl. Math. Comput., 2021
2020
Constructions of (r, t)-LRC Based on Totally Isotropic Subspaces in Symplectic Space Over Finite Fields.
Int. J. Found. Comput. Sci., 2020
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020
Discret. Math. Algorithms Appl., 2020
Deterministic construction of compressed sensing matrices from constant dimension codes.
Discret. Appl. Math., 2020
IEEE Access, 2020
2019
Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2.
Int. J. Found. Comput. Sci., 2019
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019
Cryptogr. Commun., 2019
Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes.
Appl. Math. Comput., 2019
2018
Deterministic Constructions of Compressed Sensing Matrices Based on Affine Singular Linear Space over Finite Fields.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018
Deterministic construction of compressed sensing matrices with characters over finite fields.
Discret. Math. Algorithms Appl., 2018
Discret. Math. Algorithms Appl., 2018