activity
20092020
most citedTwo-weight and three-weight linear codes based on Weil sums

57 citations · 160 across the 24 of their papers we have counts for

collaborators

24 papers

math.CO2020

On distance matrices of distance-regular graphs

Hui Zhou, Rongquan Feng

In this paper, we give a characterization of distance matrices of distance-regular graphs to be invertible.

math.CO2018

On -distance-transitive graphs

Hui Zhou, Cheryl Praeger, Michael Giudici +2

Distance-regular graphs have many beautiful combinatorial properties. Distance-transitive graphs have very strong symmetries, and they are distance-regular, i.e. distance-transitiv…

math.CO2018

Directed Strongly Regular Cayley Graphs on Dihedral groups

Yiqin He, Bicheng Zhangb, Rongquan Feng

In this paper, we characterize some certain directed strongly regular Cayley graphs on Dihedral groups , where is a positive integer.

math.CO2018★ 1 cited

Directed Strongly Regular Cayley Graphs on Dihedral groups

Yiqin He, Bicheng Zhang, Rongquan Feng

In this paper,we construct some directed strongly regular Cayley graphs on dihedral groups,these generalizes some earlier constructions.We also characterize some certain directed s…

math.CO2017★ 47 cited

Perfect codes in circulant graphs

Rongquan Feng, He Huang, Sanming Zhou

A perfect code in a graph is a subset of that is an independent set such that every vertex in is adjacent to exactly one vertex in . A total…

math.NT2017

On the Standard Lattices

Rongquan Feng, Longke Tang, Kun Wang

A lattice in the Euclidean space is standard if it has a basis consisting vectors whose norms equal to the length in its successive minima. In this paper, it is shown that with the…