On many-to-one mappings over finite fields
Yanbin Zheng, Yanjin Ding, Meiying Zhang, Pingzhi Yuan and, Qiang Wang

TL;DR
This paper introduces a unified framework for many-to-one mappings over finite fields, providing new constructions and conditions for polynomials to be m-to-1, thereby extending existing results in the field.
Contribution
It unifies and generalizes the definitions and constructions of m-to-1 mappings, and offers explicit criteria for polynomials to exhibit this property over finite fields.
Findings
Three new constructions of m-to-1 mappings are proposed.
Explicit conditions for polynomials to be m-to-1 are derived.
The results extend many previous conclusions in the literature.
Abstract
The definition of many-to-one mapping, or -to- mapping for short, between two finite sets is introduced in this paper, which unifies and generalizes the definitions of -to- mappings and -to- mappings. A generalized local criterion is given, which is an abstract criterion for a mapping to be -to-. By employing the generalized local criterion, three constructions of -to- mapping are proposed, which unify and generalize all the previous constructions of -to- mappings and -to- mappings. Then the -to- property of polynomials on is studied by using these three constructions. A series of explicit conditions for~ to be an -to- mapping on are found through the detailed discussion of the parameters , , and the polynomial . These results extend many conclusions in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Rings, Modules, and Algebras · Computability, Logic, AI Algorithms
