Gaojun Luo
Orcid: 0000-0003-1482-4783
According to our database1,
Gaojun Luo
authored at least 60 papers
between 2017 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Des. Codes Cryptogr., December, 2024
IEEE Trans. Inf. Theory, November, 2024
IEEE Trans. Inf. Theory, November, 2024
IEEE Trans. Inf. Theory, July, 2024
IEEE Trans. Inf. Theory, July, 2024
Constructing quantum error-correcting codes that require a variable amount of entanglement.
Quantum Inf. Process., January, 2024
Constructions of MDS entanglement-assisted quantum codes with flexible lengths and large minimum distance.
Discret. Math., 2024
2023
Comput. Appl. Math., October, 2023
A Construction of Maximum Distance Profile Convolutional Codes With Small Alphabet Sizes.
IEEE Trans. Inf. Theory, May, 2023
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
A Construction of Asymptotically Optimal Cascaded CDC Schemes via Combinatorial Designs.
CoRR, 2023
Proceedings of the 12th International Symposium on Topics in Coding, 2023
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
Finite Fields Their Appl., 2022
Discret. Math., 2022
Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes.
Des. Codes Cryptogr., 2022
Entanglement-Assisted and Subsystem Quantum Codes: New Propagation Rules and Constructions.
CoRR, 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
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
Adv. Math. Commun., 2021
Adv. Math. Commun., 2021
2020
Cryptogr. Commun., 2020
2019
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
Clust. Comput., 2019
Cryptogr. Commun., 2019
2018
IEEE Trans. Inf. Theory, 2018
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018
Discret. Appl. Math., 2018
Cryptogr. Commun., 2018
Cryptogr. Commun., 2018
Cryptogr. Commun., 2018
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
2017
Quantum Inf. Process., 2017
Int. J. Comput. Math. Comput. Syst. Theory, 2017
Discret. Math., 2017
Proceedings of the Eighth International Workshop on Signal Design and Its Applications in Communications, 2017