Yanjin Ding

dblp:385/1135 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0003-8953-0138ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
cryptographic function
1.012026
On Many-to-One Mappings Over Finite Fields · IEEE Trans. Inf. Theory 2026
Coding theory
finite fields
1.012026
On Many-to-One Mappings Over Finite Fields · IEEE Trans. Inf. Theory 2026

Methods — techniques the papers use, named apart from their topics

recursive construction · 1.0polynomial characterization · 1.0
YearPublicationVenuePosition
2026 On Many-to-One Mappings Over Finite Fields
abstract
We introduce the definition ofm-to-1 mappings between two finite sets, which unifies and generalizes the definitions of 2-to-1 andn-to-1 mappings in recent literature. We also characterize thesem-to-1 mappings in terms of the generalized local criterion and thus provide three generic constructions ofm-to-1 mappings, which unify and generalize the previous known constructions. Using these constructions, the problem whetherxrh(xs) ism-to-1 on the multiplicative groupF∗qis converted into that whether an associated polynomialxr1h(x)s1ism2-to-1 on the order ℓ subgroupUℓ ofF∗q, wherem2=m/(r,s) and ℓ = (q− 1)/s. Furthermore, them2-to-1 property ofxr1h(x)s1onUℓ is studied in detail in five different cases. In addition, a recursive construction ofm-to-1 mappings fromm-to-1 mappings is proposed.
Yanbin Zheng, Yanjin Ding, Meiying Zhang, Pingzhi Yuan, Qiang Wang 0012
IEEE Trans. Inf. Theory2