An upper bound on $\ell_q$ norms of noisy functions
Abstract
Let $T_{\epsilon}$ be the noise operator acting on functions on the boolean cube $\{0,1\}^n$. Let $f$ be a nonnegative function on $\{0,1\}^n$ and let $q \ge 1$. We upper bound the $\ell_q$ norm of $T_{\epsilon} f$ by the average $\ell_q$ norm of conditional expectations of $f$, given sets of roughly $(1-2\epsilon)^{r(q)} \cdot n$ variables, where $r$ is an explicitly defined function of $q$. 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.
- Publication:
-
arXiv e-prints
- Pub Date:
- September 2018
- DOI:
- arXiv:
- arXiv:1809.09696
- Bibcode:
- 2018arXiv180909696S
- Keywords:
-
- Computer Science - Information Theory;
- Mathematics - Combinatorics
- E-Print:
- A new version with some improved bounds