You Gao

Orcid: 0000-0001-8402-3477

According to our database1, You Gao authored at least 40 papers between 2009 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

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

A novel cluster heads election method based on group sparse TSK fuzzy system for energy-efficient wireless sensor network.
J. Intell. Fuzzy Syst., February, 2024

2023
New Constructions of Sidon Spaces and Cyclic Subspace Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., August, 2023

New constructions of constant dimension codes by improved inserting construction.
Appl. Math. Comput., June, 2023

2022
Fixed-Time Synchronization Analysis of Genetic Regulatory Network Model with Time-Delay.
Symmetry, 2022

2021
New construction of error-correcting pooling designs from singular linear spaces over finite fields.
J. Comb. Optim., 2021

<i>m</i>-to-1 Mappings over Finite Fields 𝔽<i><sub>q</sub></i>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

On the stopping distance of LDPC codes based on symplectic space over finite fields.
Appl. Math. Comput., 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
Two-Dimensional Frequency-Domain System Identification.
IEEE Trans. Autom. Control., 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

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
A Generalized Construction of Asymptotically Optimal Codebooks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Two constructions of asymptotically optimal codebooks according to the welch bound.
Appl. Math. Comput., 2019

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

2017
FFT formulations of adaptive Fourier decomposition.
J. Comput. Appl. Math., 2017

The Relationships Between KM-fuzzy Quasi-metric Spaces and the Associated Posets of Formal Balls.
Proceedings of the Seventh International Symposium on Domain Theory and Its Applications, 2017

Class dimension of association schemes in singular linear spaces.
Discret. Math. Algorithms Appl., 2017

2016
On pseudo-metric spaces induced by σ-⊥-decomposable measures.
Fuzzy Sets Syst., 2016

The construction of LDPC codes based on the subspaces of singular linear space over finite field.
Discret. Math. Algorithms Appl., 2016

Bounds on subspace codes based on totally isotropic subspaces in unitary spaces.
Discret. Math. Algorithms Appl., 2016

2015
Error-correcting codes in attenuated space over finite fields.
Finite Fields Their Appl., 2015

A New Construction of Multisender Authentication Codes with Simultaneous Model from Singular Symplectic Geometry over Finite Fields.
Ars Comb., 2015

2014
Bounds on Subspace Codes Based on Subspaces of Type (m, 1) in Singular Linear Space.
J. Appl. Math., 2014

Association schemes based on the subspaces of type (2, 0, 1) in singular symplectic space over finite fields.
Ars Comb., 2014

A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields.
Appl. Algebra Eng. Commun. Comput., 2014

2012
Lattices Generated by Orbits of Subspaces under Finite Singular Orthogonal Groups II.
J. Appl. Math., 2012

Lattices generated by orbits of flats under finite affine-singular symplectic groups.
Ars Comb., 2012

Lattices generated by orbits of flats under finite affine-sympletic groups.
Ars Comb., 2012

A New Construction of Authentication Code with Arbitration from (2v+2+ℓ)-dimensional Singular Pseudo-Symplectic Space.
Ars Comb., 2012

2011
Some New Constructions of Authentication Codes with Arbitration and Multi-Receiver from Singular Symplectic Geometry.
J. Appl. Math., 2011

2010
Lattices generated by orbits of subspaces under finite singular orthogonal groups I.
Finite Fields Their Appl., 2010

Lattices Generated by Subspaces under Symplectic Group over a Finite Field.
Ars Comb., 2010

Construction of Cartesian authentication codes over unitary spaces.
Proceedings of the International Conference on Machine Learning and Cybernetics, 2010

Constructions of quantum BCH codes based on finite fields of odd characteristic.
Proceedings of the International Conference on Machine Learning and Cybernetics, 2010

Non-binary quantum codes constructed from classical BCH codes.
Proceedings of the International Conference on Machine Learning and Cybernetics, 2010

2009
Lattices generated by orbits of subspaces under finite singular pseudo-symplectic groups II.
Finite Fields Their Appl., 2009

Lattices Associated With Vector Spaces Over A Finite Field.
Ars Comb., 2009


  Loading...