# Fengwei Li

Orcid: 0000-0002-9493-2890
According to our database

Collaborative distances:

^{1}, Fengwei Li authored at least 52 papers between 2004 and 2024.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2024

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

Cryptogr. Commun., July, 2024

Parallel Process. Lett., March, 2024

The greatest values for atom-bond sum-connectivity index of graphs with given parameters.

Discret. Appl. Math., February, 2024

Discret. Math., 2024

CoRR, 2024

2023

Expert Syst. Appl., November, 2023

Two-valued cross correlation distributions between binary m sequences and their decimation sequences.

Appl. Algebra Eng. Commun. Comput., November, 2023

Des. Codes Cryptogr., May, 2023

Cryptogr. Commun., May, 2023

Several classes of exponential sums and three-valued Walsh spectrums over finite fields.

Finite Fields Their Appl., March, 2023

The Decomposability of Toroidal Graphs without Adjacent Triangles or Short Cycles.

Axioms, February, 2023

Polynomial algorithms for computing the isolated toughness of interval and split graphs.

Concurr. Comput. Pract. Exp., 2023

2022

Cryptogr. Commun., 2022

Axioms, 2022

Axioms, 2022

Adv. Math. Commun., 2022

2021

The minimum Hamming distances of repeated-root cyclic codes of length $$6p^s$$ and their MDS codes.

J. Appl. Math. Comput., February, 2021

IEEE Commun. Lett., 2021

The values of two classes of Gaussian periods in index 2 case and weight distributions of linear codes.

Adv. Math. Commun., 2021

Appl. Math. Comput., 2021

2020

IEEE Trans. Inf. Theory, 2020

Note for Constructing Minimum Integrity Trees with Given Order and Maximum Degree<sup>*</sup>.

J. Interconnect. Networks, 2020

Discret. Appl. Math., 2020

Cryptogr. Commun., 2020

Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

2019

IEEE Trans. Inf. Theory, 2019

Convergence and correctness of belief propagation for the Chinese postman problem.

J. Glob. Optim., 2019

IEEE Commun. Lett., 2019

Discret. Appl. Math., 2019

Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time.

Complex., 2019

Appl. Math. Comput., 2019

2018

Discuss. Math. Graph Theory, 2018

Primitive idempotents of irreducible cyclic codes and self-dual cyclic codes over Galois rings.

Discret. Math., 2018

The primitive idempotents and weight distributions of irreducible constacyclic codes.

Des. Codes Cryptogr., 2018

Appl. Math. Comput., 2018

2017

The weight distribution of a class of cyclic codes containing a subclass with optimal parameters.

Finite Fields Their Appl., 2017

Adv. Math. Commun., 2017

Appl. Math. Comput., 2017

Appl. Math. Comput., 2017

Surface defects detection for mobilephone panel workpieces based on machine vision and machine learning.

Proceedings of the IEEE International Conference on Information and Automation, 2017

2016

Appl. Math. Comput., 2016

2015

Finite Fields Their Appl., 2015

Appl. Math. Comput., 2015

2014

IEEE Trans. Inf. Theory, 2014

Finite Fields Their Appl., 2014

Weight distributions of cyclic codes with respect to pairwise coprime order elements.

Finite Fields Their Appl., 2014

2009

Proceedings of the Combinatorial Optimization and Applications, 2009

2007

The neighbour-scattering number can be computed in polynomial time for interval graphs.

Comput. Math. Appl., 2007

Proceedings of the Combinatorial Optimization and Applications, 2007

2006

The neighbor-scattering number can be computed in polynomial time for interval graphs

CoRR, 2006

2005

Proceedings of the 8th International Symposium on Parallel Architectures, 2005

2004

Proceedings of the 7th International Symposium on Parallel Architectures, 2004