This paper presents an analysis of spinal codes, a class of rateless codes proposed recently [17].We prove that spinal codes achieve Shannon capacity for the binary symmetric channel (BSC) andthe additive white Gaussian noise (AWGN) channel with an efficient polynomial-time encoder anddecoder. They are the first rateless codes with proofs of these properties for BSC and AWGN.<lb...

This article proposes a novel scheme, based on unequal error protected rateless codes, for broadcasting layered multimedia over cooperative multiple-input multiple-output (MIMO). By taking advantage of both cooperation and broadcasting, we first present a two-phase cooperative MIMO broadcast scheme, which exploits distributed diversity in point-to-multipoint communication scenarios. Then, to en...

Large-scale machine learning and data mining applications require computer systems to perform massive matrix-vector matrix-matrix multiplication operations that need be parallelized across multiple nodes. The presence of straggling nodes---computing nodes unpredictably slow down or fail---is a major bottleneck in such distributed computations. Ideal load balancing strategies dynamically allocat...

Fountain codes were introduced to provide higher reliability, lower complexities, and more scalability for networks such as the Internet. In this thesis, we study LubyTransform (LT) codes which are the first realization of Fountain codes. In the LT codes, a sparse random factor graph is dynamically generated on both the encoder and decoder sides of the communications channel. The graph is gener...

Novel network architectures such as overlay networks offer significant diversity that can compensate for the lack of strict quality of service in today’s communication infrastructures. In order to take advantage of this diversity for delay-sensitive media streaming applications, the network systems can employ efficient mechanisms based on source, channel and even network coding. In particular, ...

Reliable wireless broadcast with asynchronous data access based on fountain coding is investigated. We review the traditional problem formalization for fountain codes operating on erasure channels and we generalize the problem formalization to arbitrary types of channels. We introduce a novel type of rateless codes based on the turbo principle: the Turbo-Fountain. The TurboFountain is able to c...