Abstract
AbstractWe investigate pairs of permutations of such that is a permutation for every . We show that, in that case, necessarily for some complete mapping of , and call the permutation a perfect nonlinear (PN) function. If , then is a PcN function, which have been considered in the literature, lately. With a binary operation on involving , we obtain a quasigroup, and show that the graph of a PN function is a difference set in the respective quasigroup. We further point to variants of symmetric designs obtained from such quasigroup difference sets. Finally, we analyze an equivalence (naturally defined via the automorphism group of the respective quasigroup) for PN functions, respectively, for the difference sets in the corresponding quasigroup.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
