English

A lower bound on the average entropy of a function determined up to a diagonal linear map on F_q^n

Combinatorics 2012-10-02 v2 Information Theory math.IT

Abstract

In this note, it is shown that if f ⁣:\efqn\efqnf\colon\efq^n\to\efq^n is any function and \bA=(A1,...,An)\bA=(A_1,..., A_n) is uniformly distributed over \efqn\efq^n, then the average over (k1,...,kn)\efqn(k_1,...,k_n)\in \efq^n of the Renyi (and hence, of the Shannon) entropy of f(\bA)+(k1A1,...,knAn)f(\bA)+(k_1A_1,...,k_nA_n) is at least about log2(qn)n\log_2(q^n)-n. In fact, it is shown that the average collision probability of f(\bA)+(k1A1,...,knAn)f(\bA)+(k_1A_1,...,k_nA_n) is at most about 2n/qn2^n/q^n.

Keywords

Cite

@article{arxiv.1105.3793,
  title  = {A lower bound on the average entropy of a function determined up to a diagonal linear map on F_q^n},
  author = {Yaron Shany and Ram Zamir},
  journal= {arXiv preprint arXiv:1105.3793},
  year   = {2012}
}

Comments

second version with a considerably simplified proof of the main theorem and additional references. 6 pages