English

An upper bound on $\ell_q$ norms of noisy functions

Information Theory 2019-11-13 v2 Combinatorics math.IT

Abstract

Let TϵT_{\epsilon} be the noise operator acting on functions on the boolean cube {0,1}n\{0,1\}^n. Let ff be a nonnegative function on {0,1}n\{0,1\}^n and let q1q \ge 1. We upper bound the q\ell_q norm of TϵfT_{\epsilon} f by the average q\ell_q norm of conditional expectations of ff, given sets of roughly (12ϵ)r(q)n(1-2\epsilon)^{r(q)} \cdot n variables, where rr is an explicitly defined function of qq. We describe some applications for error-correcting codes and for matroids. In particular, we derive an upper bound on the weight distribution of duals of BEC-capacity achieving binary linear codes. This improves the known bounds on the linear-weight components of the weight distribution of constant rate binary Reed-Muller codes for almost all rates.

Keywords

Cite

@article{arxiv.1809.09696,
  title  = {An upper bound on $\ell_q$ norms of noisy functions},
  author = {Alex Samorodnitsky},
  journal= {arXiv preprint arXiv:1809.09696},
  year   = {2019}
}

Comments

A new version with some improved bounds