Gaojun Luo

Orcid: 0000-0003-1482-4783

According to our database1, Gaojun Luo authored at least 51 papers between 2017 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Constructing quantum error-correcting codes that require a variable amount of entanglement.
Quantum Inf. Process., January, 2024

Griesmer Bound and Constructions of Linear Codes in b-Symbol Metric.
CoRR, 2024

2023
Three new constructions of optimal linear codes with few weights.
Comput. Appl. Math., October, 2023

A Construction of Maximum Distance Profile Convolutional Codes With Small Alphabet Sizes.
IEEE Trans. Inf. Theory, May, 2023

New Families of MDS Symbol-Pair Codes From Matrix-Product Codes.
IEEE Trans. Inf. Theory, March, 2023

Three New Constructions of Optimal Locally Repairable Codes From Matrix-Product Codes.
IEEE Trans. Inf. Theory, 2023

Bounds and Constructions of Quantum Locally Recoverable Codes from Quantum CSS Codes.
CoRR, 2023

Improved Spectral Bound for Quasi-Cyclic Codes.
CoRR, 2023

On non-expandable cross-bifix-free codes.
CoRR, 2023

A Construction of Asymptotically Optimal Cascaded CDC Schemes via Combinatorial Designs.
CoRR, 2023

Sharper Asymptotically Optimal CDC Schemes via Combinatorial Designs.
CoRR, 2023

Minimal Linear Codes Constructed from partial spreads.
CoRR, 2023

On Propagation Rules for Entanglement-Assisted Quantum Codes.
Proceedings of the 12th International Symposium on Topics in Coding, 2023

Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Infinite families of optimal linear codes and their applications to distributed storage systems.
J. Appl. Math. Comput., December, 2022

Several classes of permutation polynomials of the form (xpm-x+δ)s+x over Fp2m.
Finite Fields Their Appl., 2022

Asymmetric quantum Griesmer codes detecting a single bit-flip error.
Discret. Math., 2022

Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes.
Des. Codes Cryptogr., 2022

How Much Entanglement Does a Quantum Code Need?
CoRR, 2022

Entanglement-Assisted and Subsystem Quantum Codes: New Propagation Rules and Constructions.
CoRR, 2022

Minimal linear codes from weakly regular bent functions.
Cryptogr. Commun., 2022

Two new classes of Hermitian self-orthogonal non-GRS MDS codes and their applications.
Adv. Math. Commun., 2022

2021
Three New Constructions of Asymptotically Optimal Periodic Quasi-Complementary Sequence Sets With Small Alphabet Sizes.
IEEE Trans. Inf. Theory, 2021

Constructions of Optimal Binary Locally Recoverable Codes via a General Construction of Linear Codes.
IEEE Trans. Commun., 2021

A new construction of approximately SIC-POVMs derived from Jacobi sums over finite fields.
Quantum Inf. Process., 2021

A new family of EAQMDS codes constructed from constacyclic codes.
Des. Codes Cryptogr., 2021

New Interleaving Constructions of Asymptotically Optimal Periodic Quasi-Complementary Sequence Sets.
CoRR, 2021

Three New Infinite Families of Optimal Locally Repairable Codes from Matrix-Product Codes.
CoRR, 2021

A class of linear codes and their complete weight enumerators.
Adv. Math. Commun., 2021

Two classes of near-optimal codebooks with respect to the Welch bound.
Adv. Math. Commun., 2021

2020
Optimal Cyclic Codes With Hierarchical Locality.
IEEE Trans. Commun., 2020

Three deterministic constructions of compressed sensing matrices with low coherence.
Cryptogr. Commun., 2020

2019
MDS Codes With Hulls of Arbitrary Dimensions and Their Quantum Error Correction.
IEEE Trans. Inf. Theory, 2019

Two new families of entanglement-assisted quantum MDS codes from generalized Reed-Solomon codes.
Quantum Inf. Process., 2019

Optimal repairing schemes for Reed-Solomon codes with alphabet sizes linear in lengths under the rack-aware model.
CoRR, 2019

More constructions of semi-bent and plateaued functions in polynomial forms.
Clust. Comput., 2019

Several new classes of self-dual bent functions derived from involutions.
Cryptogr. Commun., 2019

Two constructions of asymptotically optimal codebooks.
Cryptogr. Commun., 2019

2018
Two Constructions of Asymptotically Optimal Codebooks via the Hyper Eisenstein Sum.
IEEE Trans. Inf. Theory, 2018

Two Classes of Linear Codes with Two or Three Weights.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

A new class of optimal linear codes with flexible parameters.
Discret. Appl. Math., 2018

MDS codes with arbitrary dimensional hull and their applications.
CoRR, 2018

Two classes of near-optimal frequency-hopping sequence sets with prime-power period.
Cryptogr. Commun., 2018

Binary linear codes with two or three weights from niho exponents.
Cryptogr. Commun., 2018

Five classes of optimal two-weight linear codes.
Cryptogr. Commun., 2018

Complete weight enumerators of three classes of linear codes.
Cryptogr. Commun., 2018

New Constructions of Codebooks Asymptotically Achieving the Welch Bound.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Two new constructions of approximately SIC-POVMs from multiplicative characters.
Quantum Inf. Process., 2017

Quantum codes from Hermitian dual-containing cyclic codes.
Int. J. Comput. Math. Comput. Syst. Theory, 2017

A construction of linear codes and strongly regular graphs from q-polynomials.
Discret. Math., 2017

A class of two-weight and three-weight codes from a certain non-quadratic function.
Proceedings of the Eighth International Workshop on Signal Design and Its Applications in Communications, 2017


  Loading...