Gang Wang

Orcid: 0000-0003-2868-4195

Affiliations:
  • Nankai University, Chern Institute of Mathematics and LPMC, China


According to our database1, Gang Wang authored at least 16 papers between 2018 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
New construction of error-correcting pooling designs from singular linear spaces over finite fields.
J. Comb. Optim., 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

Asymptotically Optimal Codebooks in Regard to the Welch Bound with Characters.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

Welch bound-achieving compressed sensing matrices from optimal codebooks.
Discret. Math. Algorithms Appl., 2020

Deterministic construction of compressed sensing matrices from constant dimension codes.
Discret. Appl. Math., 2020

Generalized asymptotically optimal codebooks.
Appl. Math. Comput., 2020

Subspace Codes Based on Partial Injective Maps of Vector Spaces Over Finite Fields.
IEEE Access, 2020

2019
Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2.
Int. J. Found. Comput. Sci., 2019

A Generalized Construction of Codebook Asymptotically Meeting the Welch Bound.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

A Generalized Construction of Asymptotically Optimal Codebooks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Deterministic constructions of compressed sensing matrices based on codes.
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

Subspace code based on flats in affine space over finite fields.
Discret. Math. Algorithms Appl., 2018


  Loading...