Multi-state Canalyzing Functions over Finite Fields
Yuan Li, David Murrugarra, John O. Adeyeye, Reinhard Laubenbacher

TL;DR
This paper generalizes Boolean canalyzing functions to finite fields, characterizes their classes, derives cardinalities, and explores asymptotic behaviors for large parameters.
Contribution
It extends the concept of canalyzing functions to finite fields and provides a complete classification and enumeration of these functions.
Findings
Characterization of eight classes of multi-state canalyzing functions
Derivation of their cardinalities and combinatorial identities
Asymptotic analysis for large number of variables or field size
Abstract
In this paper, we extend the definition of Boolean canalyzing functions to the canalyzing functions over finite field , where is a power of a prime. We obtain the characterization of all the eight classes of such functions as well as their cardinality. When , we obtain a combinatorial identity by equating our result to the formula in \cite{Win}. Finally, for a better understanding to the magnitude, we obtain the asymptotes for all the eight cardinalities as either or .
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 · Cellular Automata and Applications · Error Correcting Code Techniques
