An improved bound on ℓ_q norms of noisy functions

10/06/2020
by   Alex Samorodnitsky, et al.
0

Let T_ϵ, 0 ≤ϵ≤ 1/2, 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 ≥ 1. In arXiv:1809.09696 the ℓ_q norm of T_ϵ f was upperbounded by the average ℓ_q norm of conditional expectations of f, given sets whose elements are chosen at random with probability λ, depending on q and on ϵ. In this note we prove this inequality for integer q ≥ 2 with a better (smaller) parameter λ. The new inequality is tight for characteristic functions of subcubes. As an application, following arXiv:2008.07236, we show that a Reed-Muller code C of rate R decodes errors on BSC(p) with high probability if R  <  1 - log_2(1 + √(4p(1-p))). This is a (minor) improvement on the estimate in arXiv:2008.07236.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/25/2018

An upper bound on ℓ_q norms of noisy functions

Let T_ϵ be the noise operator acting on functions on the boolean cube {0...
research
12/16/2021

Hypercontractive inequalities for the second norm of highly concentrated functions, and Mrs. Gerber's-type inequalities for the second Renyi entropy

Let T_ϵ, 0 ≤ϵ≤ 1/2, be the noise operator acting on functions on the boo...
research
08/10/2020

Estimating the logarithm of characteristic function and stability parameter for symmetric stable laws

Let X_1,…,X_n be an i.i.d. sample from symmetric stable distribution wit...
research
09/26/2019

A moment ratio bound for polynomials and some extremal properties of Krawchouk polynomials and Hamming spheres

Let p > 2. We improve the bound f_p/f_2< (p-1)^s/2 for a polynomial f of...
research
05/22/2023

On the Implementation of Boolean Functions on Content-Addressable Memories

Let [q⟩ denote the integer set {0,1,…,...,q-1} and let 𝔹={0,1}. The prob...
research
07/23/2021

Universal sampling discretization

Let X_N be an N-dimensional subspace of L_2 functions on a probability s...
research
07/30/2018

On the Most Informative Boolean Functions of the Very Noisy Channel

Let X^n be an independently identically distributed Bernoulli (1/2) rand...

Please sign up or login with your details

Forgot password? Click here to reset