activity
20112023
most citedPermutation trinomials over : a corrected version

64 citations · 258 across the 71 of their papers we have counts for

collaborators
Showing math.COShow all

7 papers · 1 filter

math.CO2022★ 64 cited

Permutation trinomials over : a corrected version

Danyao Wu, Pingzhi Yuan, Cunsheng Ding +1

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we determine all permutation t…

math.CO2019★ 6 cited

Combinatorial -designs from special polynomials

Cunsheng Ding, Chunming Tang

Combinatorial -designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing -designs. One of…

math.CO2018★ 4 cited

A family of ovoids in PG(3, 2^m) from cyclic codes

Cunsheng Ding

Ovoids in $\PG(3, q)$ have been an interesting topic in coding theory, combinatorics, and finite geometry for a long time. So far only two families are known. The first is the elli…

math.CO2017

Maximal arcs and extended cyclic codes

Stefaan De Winter, Cunsheng Ding, Vladimir D. Tonchev

It is proved that for every such that divides , where is a power of 2, there exists a Denniston maximal arc of degree in $\PG(2,q)$, being invariant…

math.CO2017★ 4 cited

Infinite families of 2-designs from GA_1(q) actions

Hao Liu, Cunsheng Ding

Group action is a standard approach to obtain -designs. In this approach, selecting a specific permutation group with a certain degree of transitivity or homogeneity and a prope…

math.CO2017

A spectral characterisation of t-designs and its applications

Eun-Kyung Cho, Cunsheng Ding, Jong Yoon Hyun

There are two standard approaches to the construction of -designs. The first one is based on permutation group actions on certain base blocks. The second one is based on coding…