Ziling Heng

IEEE Trans. Inf. Theory, July, 2024

An improvement on Weil bounds for character sums of polynomials over finite fields.

[BibT_eX]

[DOI]

Cryptogr. Commun., July, 2024

Binary and ternary leading-systematic LCD codes from special functions.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2024

A family of self-orthogonal divisible codes with locality 2.

[BibT_eX]

[DOI]

Mengjie Yang

Yang Ming

CoRR, 2024

The augmented codes of a family of linear codes with locality 2.

[BibT_eX]

[DOI]

Keqing Cao

CoRR, 2024

More MDS codes of non-Reed-Solomon type.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Three families of self-orthogonal codes and their application in optimal quantum codes.

[BibT_eX]

[DOI]

Dexiang Li

Discret. Math., December, 2023

Ternary self-orthogonal codes from weakly regular bent functions and their application in LCD Codes.

[BibT_eX]

[DOI]

Dexiang Li

Fenjin Liu

Des. Codes Cryptogr., December, 2023

Constructions of near MDS codes which are optimal locally recoverable codes.

[BibT_eX]

[DOI]

Finite Fields Their Appl., June, 2023

A construction of optimal locally recoverable codes.

[BibT_eX]

[DOI]

Cryptogr. Commun., May, 2023

Projective Linear Codes From Some Almost Difference Sets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, February, 2023

Constructions of cyclic codes and extended primitive cyclic codes with their applications.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2023

New infinite families of near MDS codes holding t-designs.

[BibT_eX]

[DOI]

Discret. Math., 2023

Self-orthogonal codes from p-divisible codes.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Constructions of MDS, Near MDS and Almost MDS Codes From Cyclic Subgroups of F*q2.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

The Subfield Codes of Some [q + 1, 2, q] MDS Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Constructions of projective linear codes by the intersection and difference of sets.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2022

Linear complexity over ${\mathbb {F}_{{q}}}$ and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2022

New infinite families of near MDS codes holding $t$-designs and optimal locally recoverable codes.

[BibT_eX]

[DOI]

CoRR, 2022

Infinite families of $ t $-designs and strongly regular graphs from punctured codes.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2022

Near MDS Codes with Dimension 4 and Their Application in Locally Recoverable Codes.

[BibT_eX]

[DOI]

Proceedings of the Arithmetic of Finite Fields - 9th International Workshop, 2022

2021

Near MDS codes from oval polynomials.

[BibT_eX]

[DOI]

Qiuyan Wang

Discret. Math., 2021

A family of projective two-weight linear codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2021

Linear complexity over Fq and 2-adic complexity of a class of binary generalized cyclotomic sequences with low-value autocorrelation.

[BibT_eX]

[DOI]

CoRR, 2021

Projective binary linear codes from special Boolean functions.

[BibT_eX]

[DOI]

Weiqiong Wang

Yan Wang

Appl. Algebra Eng. Commun. Comput., 2021

2020

Two Families of Optimal Linear Codes and Their Subfield Codes.

[BibT_eX]

[DOI]

Qiuyan Wang

IEEE Trans. Inf. Theory, 2020

Optimal Binary Linear Codes From Maximal Arcs.

[BibT_eX]

[DOI]

Weiqiong Wang

IEEE Trans. Inf. Theory, 2020

The Subfield Codes of [q+1, 2, q] MDS Codes.

[BibT_eX]

[DOI]

CoRR, 2020

2019

The Subfield Codes of Ovoid Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

The subfield codes of hyperoval and conic codes.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2019

A construction of q-ary linear codes with irreducible cyclic codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

2018

Minimal Binary Linear Codes.

[BibT_eX]

[DOI]

Zhengchun Zhou

IEEE Trans. Inf. Theory, 2018

Minimal linear codes over finite fields.

[BibT_eX]

[DOI]

Zhengchun Zhou

Finite Fields Their Appl., 2018

Nearly optimal codebooks based on generalized Jacobi sums.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

A construction of q-ary linear codes with two weights.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2017

Evaluation of the Hamming weights of a class of linear codes based on Gauss sums.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2017

Asymptotically optimal codebooks based on generalized Jacobi sums.

[BibT_eX]

[DOI]

CoRR, 2017

Complete weight distributions of two classes of cyclic codes.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2017

Optimal codebooks achieving the Levenshtein bound from generalized bent functions over ℤ 4 Z4.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2017

2016

Several Classes of Cyclic Codes With Either Optimal Three Weights or a Few Weights.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Two classes of two-weight linear codes.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2016

Three classes of linear codes with two or three weights.

[BibT_eX]

[DOI]

Discret. Math., 2016

Optimal linear codes, constant-weight codes and constant-composition codes over $\Bbb F_{q}$.

[BibT_eX]

[DOI]

CoRR, 2016

2015

A Class of Binary Linear Codes With at Most Three Weights.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2015

Generalized Gray map and a class of p-ary nonlinear codes.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2015

Evaluation of the weight distribution of a class of linear codes based on semi-primitive Gauss sums.

[BibT_eX]

[DOI]

CoRR, 2015

Weight distributions of a class of cyclic codes from Fl-conjugates.

[BibT_eX]

[DOI]