Broadcasting on trees near criticality
ISIT, pp. 1504-1509, 2020.
We revisit the problem of broadcasting on d-ary trees: starting from a Bernoulli(1/2) random variable X 0 at a root vertex, each vertex forwards its value across binary symmetric channels BSC δ to d descendants. The goal is to reconstruct X 0 given the vector X Lh of values of all variables at depth h. It is well known that reconstruc...More
PPT (Upload PPT)