5 citations · 6 across the 2 of their papers we have counts for
3 papers
cs.IT2020★ 1 cited
Broadcasting on trees near criticality
Yuzhou Gu, Hajir Roozbehani, Yury Polyanskiy
We revisit the problem of broadcasting on -ary trees: starting from a Bernoulli random variable at a root vertex, each vertex forwards its value across binary symme…
cs.IT2019★ 5 cited
Low density majority codes and the problem of graceful degradation
Hajir Roozbehani, Yury Polyanskiy
We study a problem of constructing codes that transform a channel with high bit error rate (BER) into one with low BER (at the expense of rate). Our focus is on obtaining codes wit…
cs.IT2019
On Low Density Majority Codes
Hajir Roozbehani, Yury Polyanskiy
We study a problem of constructing codes that transform a channel with high bit error rate (BER) into one with low BER (at the expense of rate). Our focus is on obtaining codes wit…