A lower bound on the average entropy of a function determined up to a diagonal linear map on F_q^n
Yaron Shany, Ram Zamir

TL;DR
This paper establishes a lower bound on the average entropy of functions over finite fields when subjected to diagonal linear transformations, highlighting fundamental entropy limits in such transformations.
Contribution
It provides a novel lower bound on the average Shannon and Renyi entropy for functions under diagonal linear maps over finite fields.
Findings
Average entropy is at least about log2(q^n)-n.
Collision probability is at most about 2^n/q^n.
Results apply to any function with uniformly random diagonal linear shifts.
Abstract
In this note, it is shown that if is any function and is uniformly distributed over , then the average over of the Renyi (and hence, of the Shannon) entropy of is at least about . In fact, it is shown that the average collision probability of is at most about .
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
TopicsMathematical Dynamics and Fractals · Limits and Structures in Graph Theory · Markov Chains and Monte Carlo Methods
