Name
Abstract | ||
|---|---|---|
Let Z(n) be iid Bernoulli(delta) and U-n be uniform on the set of all binary vectors of weight delta n (Hamming sphere). As is well known, the entropies of Z(n) and U-n are within O(log n). However, if X-n is another binary random variable independent of Z(n) and U-n, we show that H (X-n + U-n) and H (X-n + Z(n)) are within O (root n) and this estimate is tight. The bound is shown via coupling method. Tightness follows from the observation that the channels x(n) -> x(n) + U-n and x(n) -> x(n) + Z(n) have similar capacities, but the former has zero dispersion. Finally, we show that despite the root n slack in general, the Mrs. Gerber Lemma for H (X-n + U-n) holds with only an O(log n) correction compared to its brethren for H (X-n + Z(n)). |
Year | Venue | Field |
|---|---|---|
2018 | 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | Binary logarithm,Discrete mathematics,Combinatorics,Random variable,Computer science,Bernoulli's principle,Binary number |
DocType | Citations | PageRank |
Conference | 1 | 0.35 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Or Ordentlich | 1 | 121 | 18.37 |
| yury polyanskiy | 2 | 1141 | 87.77 |