Fengwei Li

Parallel Process. Lett., March, 2024

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

[BibT_eX]

[DOI]

Huajing Lu

Discret. Appl. Math., February, 2024

The maximum designed distances of dual-containing non-primitive BCH codes.

[BibT_eX]

[DOI]

Daitao Huang

Discret. Math., 2024

Extremal graphs with given parameters in respect of general ABS index.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2024

2023

Automatic detection of surface defects based on deep random chains.

[BibT_eX]

[DOI]

Expert Syst. Appl., November, 2023

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

[BibT_eX]

[DOI]

Fengmei Liu

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

Cyclic codes of length 5p with MDS symbol-pair.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., May, 2023

Two classes of quasi-cyclic codes via irreducible polynomials.

[BibT_eX]

[DOI]

Daitao Huang

Cryptogr. Commun., May, 2023

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

[BibT_eX]

[DOI]

Finite Fields Their Appl., March, 2023

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

[BibT_eX]

[DOI]

Huajing Lu

Axioms, February, 2023

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

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2023

2022

The Hermitian dual-containing LCD BCH codes and related quantum codes.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2022

ISI-Equienergetic Graphs.

[BibT_eX]

[DOI]

Axioms, 2022

Some New Bounds for the Inverse Sum Indeg Energy of Graphs.

[BibT_eX]

[DOI]

Hajo Broersma

Axioms, 2022

Another expression of the MacWilliams identities and its applications.

[BibT_eX]

[DOI]

Xuemei Wang

Adv. Math. Commun., 2022

2021

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

[BibT_eX]

[DOI]

Ying Gao

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

The Hermitian Dual Containing Non-Primitive BCH Codes.

[BibT_eX]

[DOI]

Xiaoming Sun

IEEE Commun. Lett., 2021

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

[BibT_eX]

[DOI]

Xiaoming Sun

Adv. Math. Commun., 2021

Extremality of VDB topological indices over f-benzenoids with given order.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2021

2020

LCD and Self-Orthogonal Group Codes in a Finite Abelian $p$ -Group Algebra.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Note for Constructing Minimum Integrity Trees with Given Order and Maximum Degree*.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2020

A class of functions with low-valued Walsh spectrum.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Designed distances and parameters of new LCD BCH codes over finite fields.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2020

Optimal Algorithm of Isolated Toughness for Interval Graphs.

[BibT_eX]

[DOI]

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

2019

Three Families of Monomial Functions With Three-Valued Walsh Spectrum.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

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

[BibT_eX]

[DOI]

J. Glob. Optim., 2019

More Functions With Three-Valued Walsh Transform From Linear Combinations.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2019

A polynomial algorithm for weighted scattering number in interval graphs.

[BibT_eX]

[DOI]

Xiaoyan Zhang

Hajo Broersma

Discret. Appl. Math., 2019

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

[BibT_eX]

[DOI]

Complex., 2019

The generalized 3-connectivity of the Mycielskian of a graph.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2019

2018

On two generalized connectivities of graphs.

[BibT_eX]

[DOI]

Zemin Jin

Yuefang Sun

Discuss. Math. Graph Theory, 2018

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

[BibT_eX]

[DOI]

Discret. Math., 2018

The primitive idempotents and weight distributions of irreducible constacyclic codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2018

Extremal benzenoid systems for two modified versions of the Randić index.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

2017

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

[BibT_eX]

[DOI]

Fengmei Liu

Finite Fields Their Appl., 2017

The weight distributions of constacyclic codes.

[BibT_eX]

[DOI]

Fengmei Liu

Adv. Math. Commun., 2017

On total rainbow k-connected graphs.

[BibT_eX]

[DOI]

Yuefang Sun

Zemin Jin

Appl. Math. Comput., 2017

On edge-rupture degree of graphs.

[BibT_eX]

[DOI]

Yuefang Sun

Appl. Math. Comput., 2017

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

[BibT_eX]

[DOI]

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

2016

The general connectivity indices of fluoranthene-type benzenoid systems.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2016

2015

Irreducible cyclic codes of length 4pn and 8pn.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2015

Second order Randić index of fluoranthene-type benzenoid systems.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2015

2014

Hamming Weights of the Duals of Cyclic Codes With Two Zeros.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

The minimum Hamming distances of irreducible cyclic codes.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2014

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

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2014

2009

On Integrity of Harary Graphs.

[BibT_eX]

[DOI]

Baohuai Sheng

Proceedings of the Combinatorial Optimization and Applications, 2009

2007

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

[BibT_eX]

[DOI]

Comput. Math. Appl., 2007

The Size of a Minimum Critically m -Neighbor-Scattered Graph.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2007

2006

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

[BibT_eX]

[DOI]

CoRR, 2006

2005

Computational complexity and bounds for neighbor-scattering number of graphs.

[BibT_eX]

[DOI]

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

2004

Computing the Rupture Degrees of Graphs.

[BibT_eX]

[DOI]