Name
Abstract | ||
|---|---|---|
In this note, we prove a tight lower bound on the joint entropy of n unbiased Bernoulli random variables which are n/2-wise independent.For general k-wise independence, we give new lower bounds by adapting Navon and Samorodnitsky's Fourier proof of the 'LP bound' on error correcting codes.This counts as partial progress on a problem asked by Gavinsky and Pudlak in [3]. |
Year | Venue | Field |
|---|---|---|
2018 | 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | Discrete mathematics,Combinatorics,Random variable,Upper and lower bounds,Computer science,Fourier transform,Joint entropy,Bernoulli's principle |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amey Bhangale | 1 | 10 | 6.71 |
| Aditya Potukuchi | 2 | 0 | 1.01 |