activity
20132017
most citedCoding with Constraints: Minimum Distance Bounds and Systematic Constructions

2 citations · 3 across the 4 of their papers we have counts for

collaborators

6 papers

cs.IT2017

Improving Distributed Gradient Descent Using Reed-Solomon Codes

Wael Halbawi, Navid Azizan-Ruhi, Fariborz Salehi +1

Today's massively-sized datasets have made it necessary to often perform computations on them in a distributed manner. In principle, a computational task is divided into subtasks w…

cs.IT2017★ 1 cited

Representations of the Multicast Network Problem

Sarah E. Anderson, Wael Halbawi, Nathan Kaplan +4

We approach the problem of linear network coding for multicast networks from different perspectives. We introduce the notion of the coding points of a network, which are edges of t…

cs.IT2016

(Almost) Practical Tree Codes

Anatoly Khina, Wael Halbawi, Babak Hassibi

We consider the problem of stabilizing an unstable plant driven by bounded noise over a digital noisy communication link, a scenario at the heart of networked control. To stabilize…

cs.IT2016

Balanced Reed-Solomon Codes

Wael Halbawi, Zihan Liu, Babak Hassibi

We consider the problem of constructing linear Maximum Distance Separable (MDS) error-correcting codes with generator matrices that are sparsest and balanced. In this context, spar…

cs.IT2015★ 2 cited

Coding with Constraints: Minimum Distance Bounds and Systematic Constructions

Wael Halbawi, Matthew Thill, Babak Hassibi

We examine an error-correcting coding framework in which each coded symbol is constrained to be a function of a fixed subset of the message symbols. With an eye toward distributed…

cs.IT2013

Distributed Reed-Solomon Codes for Simple Multiple Access Networks

Wael Halbawi, Tracey Ho, Hongyi Yao +1

We consider a simple multiple access network in which a destination node receives information from multiple sources via a set of relay nodes. Each relay node has access to a subset…