Broadcasting on trees near criticality
© 2020 IEEE. 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 varia...
Main Authors: | Gu, Yuzhou, Roozbehani, Hajir, Polyanskiy, Yury |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021
|
Online Access: | https://hdl.handle.net/1721.1/137601 |
Similar Items
-
Broadcasting on trees near criticality
by: Gu, Yuzhou, et al.
Published: (2021) -
Broadcasting on Trees Near Criticality: Perturbation Theory
by: Yu, Qian, et al.
Published: (2022) -
Graceful degradation over the BEC via non-linear codes
by: Hosseini Roozbehani, Hajir, et al.
Published: (2021) -
Input-Output Distance Properties of Good Linear Codes
by: Hosseini Roozbehani, Hajir, et al.
Published: (2020) -
Algebraic methods of classifying directed graphical models
by: Polyanskiy, Yury, et al.
Published: (2016)