| Publication | Date of Publication | Type |
|---|
Two families of linear codes with desirable properties from some functions over finite fields
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Self-orthogonal codes from p-divisible codes
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Combinatorial \(t\)-designs and strongly regular graphs from projective codes over finite fields
Acta Mathematica Sinica. Chinese Series | 2024-11-04 | Paper |
LCD codes and almost optimally extendable codes from self-orthogonal codes
Designs, Codes and Cryptography | 2024-10-14 | Paper |
An improvement on Weil bounds for character sums of polynomials over finite fields
Cryptography and Communications | 2024-08-13 | Paper |
Several families of self-orthogonal codes and their applications in optimal quantum codes and LCD codes
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Binary and ternary leading-systematic LCD codes from special functions
Finite Fields and their Applications | 2024-07-02 | Paper |
Projective Linear Codes From Some Almost Difference Sets
IEEE Transactions on Information Theory | 2024-03-18 | Paper |
Constructions of MDS, Near MDS and Almost MDS Codes From Cyclic Subgroups of F*q 2
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
Ternary self-orthogonal codes from weakly regular bent functions and their application in LCD codes
Designs, Codes and Cryptography | 2023-11-20 | Paper |
Three families of self-orthogonal codes and their application in optimal quantum codes
Discrete Mathematics | 2023-10-04 | Paper |
Hybrid character sums and near-optimal partial Hadamard codebooks
Journal of Algebra | 2023-09-25 | Paper |
Near MDS codes with dimension 4 and their application in locally recoverable codes
Arithmetic of Finite Fields | 2023-08-10 | Paper |
New infinite families of near MDS codes holding \(t\)-designs
Discrete Mathematics | 2023-07-19 | Paper |
Infinite families of \(t\)-designs and strongly regular graphs from punctured codes
Advances in Mathematics of Communications | 2023-07-07 | Paper |
A construction of optimal locally recoverable codes
Cryptography and Communications | 2023-07-03 | Paper |
Constructions of cyclic codes and extended primitive cyclic codes with their applications
Finite Fields and their Applications | 2023-06-19 | Paper |
Constructions of near MDS codes which are optimal locally recoverable codes
Finite Fields and their Applications | 2023-04-27 | Paper |
Constructions of projective linear codes by the intersection and difference of sets
Finite Fields and their Applications | 2022-08-26 | Paper |
Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation
Designs, Codes and Cryptography | 2022-08-04 | Paper |
The Subfield Codes of Some [q + 1, 2, q MDS Codes]
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Constructions of near MDS codes which are optimal locally recoverable codes
(available as arXiv preprint) | 2022-04-24 | Paper |
Projective binary linear codes from special Boolean functions
Applicable Algebra in Engineering, Communication and Computing | 2021-09-10 | Paper |
Note on graphs with irreducible characteristic polynomials
Linear Algebra and its Applications | 2021-09-02 | Paper |
A family of projective two-weight linear codes
Designs, Codes and Cryptography | 2021-08-02 | Paper |
Near MDS codes from oval polynomials
Discrete Mathematics | 2021-03-25 | Paper |
Two Families of Optimal Linear Codes and Their Subfield Codes
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
Optimal Binary Linear Codes From Maximal Arcs
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
The Subfield Codes of Ovoid Codes
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
A construction of \(q\)-ary linear codes with irreducible cyclic codes
Designs, Codes and Cryptography | 2019-05-17 | Paper |
The subfield codes of hyperoval and conic codes
Finite Fields and their Applications | 2019-03-27 | Paper |
Nearly optimal codebooks based on generalized Jacobi sums
Discrete Applied Mathematics | 2018-10-26 | Paper |
Minimal linear codes over finite fields
Finite Fields and their Applications | 2018-10-24 | Paper |
Minimal Binary Linear Codes
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
A construction of \(q\)-ary linear codes with two weights
Finite Fields and their Applications | 2017-10-05 | Paper |
Several Classes of Cyclic Codes With Either Optimal Three Weights or a Few Weights
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
Designs, Codes and Cryptography | 2017-04-13 | Paper |
Complete weight distributions of two classes of cyclic codes
Cryptography and Communications | 2017-02-09 | Paper |
Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
Cryptography and Communications | 2017-01-05 | Paper |
Three classes of linear codes with two or three weights
Discrete Mathematics | 2016-07-05 | Paper |
Two classes of two-weight linear codes
Finite Fields and their Applications | 2016-02-09 | Paper |
Generalized Gray map and a class of \(p\)-ary nonlinear codes
Finite Fields and their Applications | 2015-10-19 | Paper |
Weight distributions of a class of cyclic codes from \(\mathbb F_l\)-conjugates
Advances in Mathematics of Communications | 2015-08-04 | Paper |
| Constructions of quaternary sequences with ideal autocorrelation | 2015-02-11 | Paper |
| Constructions of new difference families and almost difference families | 2014-02-28 | Paper |
More MDS codes of non-Reed-Solomon type
(available as arXiv preprint) | N/A | Paper |
