A class of two-weight and three-weight codes from a certain non-quadratic function. - Guangkui Xu; Xiwang Cao; Wei Du; Gaojun Luo (IWSDA, 2017)

A construction of linear codes and strongly regular graphs from q-polynomials. - Gaojun Luo; Xiwang Cao (Discret. Math., 2017)

Quantum codes from Hermitian dual-containing cyclic codes. - Jiafu Mi; Xiwang Cao; Shanding Xu; Gaojun Luo (Int. J. Comput. Math. Comput. Syst. Theory, 2017)

Two new constructions of approximately SIC-POVMs from multiplicative characters. - Gaojun Luo; Xiwang Cao (Quantum Inf. Process., 2017)

New Constructions of Codebooks Asymptotically Achieving the Welch Bound. - Gaojun Luo; Xiwang Cao (ISIT, 2018)

Complete weight enumerators of three classes of linear codes. - Gaojun Luo; Xiwang Cao (Cryptogr. Commun., 2018)

Five classes of optimal two-weight linear codes. - Gaojun Luo; Xiwang Cao (Cryptogr. Commun., 2018)

Binary linear codes with two or three weights from niho exponents. - Gaojun Luo; Xiwang Cao; Shanding Xu; Jiafu Mi (Cryptogr. Commun., 2018)

Two classes of near-optimal frequency-hopping sequence sets with prime-power period. - Shanding Xu; Xiwang Cao; Guangkui Xu; Gaojun Luo (Cryptogr. Commun., 2018)

MDS codes with arbitrary dimensional hull and their applications. - Gaojun Luo; Xiwang Cao (CoRR, 2018)

A new class of optimal linear codes with flexible parameters. - Gaojun Luo; Xiwang Cao; Guangkui Xu; Shanding Xu (Discret. Appl. Math., 2018)

Two Classes of Linear Codes with Two or Three Weights. - Guangkui Xu; Xiwang Cao; Jian Gao 001; Gaojun Luo (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Two Constructions of Asymptotically Optimal Codebooks via the Hyper Eisenstein Sum. - Gaojun Luo; Xiwang Cao (IEEE Trans. Inf. Theory, 2018)

Two constructions of asymptotically optimal codebooks. - Gaojun Luo; Xiwang Cao (Cryptogr. Commun., 2019)

Several new classes of self-dual bent functions derived from involutions. - Gaojun Luo; Xiwang Cao; Sihem Mesnager (Cryptogr. Commun., 2019)

More constructions of semi-bent and plateaued functions in polynomial forms. - Tao Xie; Gaojun Luo (Clust. Comput., 2019)

Optimal repairing schemes for Reed-Solomon codes with alphabet sizes linear in lengths under the rack-aware model. - Lingfei Jin; Gaojun Luo; Chaoping Xing (CoRR, 2019)

Two new families of entanglement-assisted quantum MDS codes from generalized Reed-Solomon codes. - Gaojun Luo; Xiwang Cao (Quantum Inf. Process., 2019)

MDS Codes With Hulls of Arbitrary Dimensions and Their Quantum Error Correction. - Gaojun Luo; Xiwang Cao; Xiaojing Chen 002 (IEEE Trans. Inf. Theory, 2019)

Three deterministic constructions of compressed sensing matrices with low coherence. - Xiwang Cao; Gaojun Luo; Guangkui Xu (Cryptogr. Commun., 2020)

Optimal Cyclic Codes With Hierarchical Locality. - Gaojun Luo; Xiwang Cao (IEEE Trans. Commun., 2020)

Two classes of near-optimal codebooks with respect to the Welch bound. - Gaojun Luo; Xiwang Cao (Adv. Math. Commun., 2021)

A class of linear codes and their complete weight enumerators. - Dandan Wang; Xiwang Cao; Gaojun Luo (Adv. Math. Commun., 2021)

Three New Infinite Families of Optimal Locally Repairable Codes from Matrix-Product Codes. - Gaojun Luo; Martianus Frederic Ezerman; San Ling (CoRR, 2021)

New Interleaving Constructions of Asymptotically Optimal Periodic Quasi-Complementary Sequence Sets. - Gaojun Luo; Martianus Frederic Ezerman; San Ling (CoRR, 2021)

A new family of EAQMDS codes constructed from constacyclic codes. - Xiaojing Chen 002; Shixin Zhu; Wan Jiang; Gaojun Luo (Des. Codes Cryptogr., 2021)

A new construction of approximately SIC-POVMs derived from Jacobi sums over finite fields. - Gaojun Luo; Xiwang Cao; Dandan Wang; Qiuyan Wang (Quantum Inf. Process., 2021)

Constructions of Optimal Binary Locally Recoverable Codes via a General Construction of Linear Codes. - Gaojun Luo; Xiwang Cao (IEEE Trans. Commun., 2021)

Three New Constructions of Asymptotically Optimal Periodic Quasi-Complementary Sequence Sets With Small Alphabet Sizes. - Gaojun Luo; Xiwang Cao; Minjia Shi; Tor Helleseth (IEEE Trans. Inf. Theory, 2021)

Two new classes of Hermitian self-orthogonal non-GRS MDS codes and their applications. - Gaojun Luo; Xiwang Cao; Martianus Frederic Ezerman; San Ling (Adv. Math. Commun., 2022)

Minimal linear codes from weakly regular bent functions. - Guangkui Xu; Longjiang Qu; Gaojun Luo (Cryptogr. Commun., 2022)

Entanglement-Assisted and Subsystem Quantum Codes: New Propagation Rules and Constructions. - Gaojun Luo; Martianus Frederic Ezerman; San Ling (CoRR, 2022)

How Much Entanglement Does a Quantum Code Need? - Gaojun Luo; Martianus Frederic Ezerman; Markus Grassl; San Ling (CoRR, 2022)

Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes. - Gaojun Luo; San Ling (Des. Codes Cryptogr., 2022)

Asymmetric quantum Griesmer codes detecting a single bit-flip error. - Gaojun Luo; Martianus Frederic Ezerman; San Ling (Discret. Math., 2022)

Several classes of permutation polynomials of the form (xpm-x+δ)s+x over Fp2m. - Guangkui Xu; Gaojun Luo; Xiwang Cao (Finite Fields Their Appl., 2022)

Infinite families of optimal linear codes and their applications to distributed storage systems. - Hui Yan; Kezheng Zuo; Gaojun Luo (J. Appl. Math. Comput., 2022)

Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes. - Stanislav Kruglik; Gaojun Luo; Wilton Kim; Shubhransh Singhvi; Han Mao Kiah; San Ling; Huaxiong Wang (ISIT, 2023)

On Propagation Rules for Entanglement-Assisted Quantum Codes. - Gaojun Luo; Lin Sok; Martianus Frederic Ezerman; San Ling (ISTC, 2023)

Minimal Linear Codes Constructed from partial spreads. - Wei Lu 022; Xia Wu 002; Xiwang Cao; Gaojun Luo; Xupu Qin (CoRR, 2023)

Sharper Asymptotically Optimal CDC Schemes via Combinatorial Designs. - Yingjie Cheng; Gaojun Luo; Xiwang Cao; Martianus Frederic Ezerman; San Ling (CoRR, 2023)

A Construction of Asymptotically Optimal Cascaded CDC Schemes via Combinatorial Designs. - Yingjie Cheng; Gaojun Luo; Xiwang Cao; Martianus Frederic Ezerman; San Ling (CoRR, 2023)

On non-expandable cross-bifix-free codes. - Chunyan Qin; Bocong Chen; Gaojun Luo (CoRR, 2023)

Three New Constructions of Optimal Locally Repairable Codes From Matrix-Product Codes. - Gaojun Luo; Martianus Frederic Ezerman; San Ling (IEEE Trans. Inf. Theory, 2023)

New Families of MDS Symbol-Pair Codes From Matrix-Product Codes. - Gaojun Luo; Martianus Frederic Ezerman; San Ling; Xu Pan (IEEE Trans. Inf. Theory, 2023)

A Construction of Maximum Distance Profile Convolutional Codes With Small Alphabet Sizes. - Gaojun Luo; Xiwang Cao; Martianus Frederic Ezerman; San Ling (IEEE Trans. Inf. Theory, 2023)

Three new constructions of optimal linear codes with few weights. - Yingjie Cheng; Xiwang Cao; Gaojun Luo (Comput. Appl. Math., 2023)

On Linear Codes Whose Hermitian Hulls are MD. - Gaojun Luo; Lin Sok; Martianus Frederic Ezerman; San Ling (CoRR, 2024)

Constructions of MDS entanglement-assisted quantum codes with flexible lengths and large minimum distance. - Yingjie Cheng; Xiwang Cao; Gaojun Luo (Discret. Math., 2024)

Constructing quantum error-correcting codes that require a variable amount of entanglement. - Gaojun Luo; Martianus Frederic Ezerman; Markus Grassl; San Ling (Quantum Inf. Process., 2024)

Hulls of linear codes from simplex codes. - Guangkui Xu; Gaojun Luo; Xiwang Cao; Heqian Xu (Des. Codes Cryptogr., 2024)

Minimal linear codes constructed from partial spreads. - Xia Wu 002; Wei Lu 022; Xiwang Cao; Gaojun Luo (Cryptogr. Commun., 2024)

Improved Spectral Bound for Quasi-Cyclic Codes. - Gaojun Luo; Martianus Frederic Ezerman; San Ling; Buket Özkaya (IEEE Trans. Inf. Theory, 2024)

On the Weights of Linear Codes With Prescribed Automorphisms. - Gaojun Luo; Xiwang Cao; Martianus Frederic Ezerman; San Ling (IEEE Trans. Inf. Theory, 2024)

On Linear Codes Whose Hermitian Hulls are MDS. - Gaojun Luo; Lin Sok; Martianus Frederic Ezerman; San Ling (IEEE Trans. Inf. Theory, 2024)

Constructions of Non-Expandable Cross-Bifix-Free Codes via Expandable Codes. - Chunyan Qin; Bocong Chen; Gaojun Luo (IEEE Trans. Inf. Theory, 2024)

Combinatorial Constructions of Optimal Quaternary Additive Codes. - Chaofeng Guan; Jingjie Lv; Gaojun Luo; Zhi Ma 001 (IEEE Trans. Inf. Theory, 2024)

Griesmer Bound and Constructions of Linear Codes in b-Symbol Metric. - Gaojun Luo; Martianus Frederic Ezerman; Cem Güneri; San Ling; Ferruh Özbudak (IEEE Trans. Inf. Theory, 2024)

Infinite families of 3-designs from special symmetric polynomials. - Guangkui Xu; Xiwang Cao; Gaojun Luo; Huawei Wu (Des. Codes Cryptogr., 2024)

Generalized bilateral multilevel construction for constant dimension codes. - Xiaoqin Hong; Xiwang Cao; Gaojun Luo (Des. Codes Cryptogr., 2025)

Bounds and Constructions of Quantum Locally Recoverable Codes From Quantum CSS Codes. - Gaojun Luo; Bocong Chen; Martianus Frederic Ezerman; San Ling (IEEE Trans. Inf. Theory, 2025)

A generalized construction of variable-length non-overlapping codes. - Chunyan Qin; Gaojun Luo (Des. Codes Cryptogr., 2025)

Lower Bounds for Error Coefficients of Griesmer Optimal Linear Codes via Iteration. - Chaofeng Guan; Shitao Li; Gaojun Luo; Zhi Ma; Hong Wang (CoRR, 2025)

On the Error Coefficients of Asymptotic Frame Error Rate Optimal Binary Linear Codes. - Shitao Li; Gaojun Luo; Minjia Shi; San Ling (IEEE Trans. Inf. Theory, 2025)

New Constructions of Asymptotically Optimal Quasi-Complementary Sequence Sets With Small Alphabet Sizes. - Hongyang Xiao; Gaojun Luo; Xiwang Cao (IEEE Trans. Commun., 2025)