Now showing items 1-5 of 5
Low-Complexity Soliton-like Network Coding for a Resource-Limited Relay
Network coding (NC) is an optimal data dissemination technique where intermediate nodes linearly combine incoming packets. To recover a network-coded message, a sink must use a Gaussian elimination decoder, but this ...
Rateless Coding for Single-Source Networks with Common Information
In this thesis, we consider the communication problem of a single source simultaneously transmitting to multiple receivers whose sets of requested messages overlap. For decades, one of the challenges in this broadcast ...
Distributed Data Storage System for Data Survivability in Wireless Sensor Networks
Wireless Sensor Networks (WSNs) that use tiny wireless devices capable of communicating, processing, and sensing promise to have applications in virtually all fields. Smart homes and smart cities are just few of the examples ...
Improving the Left Degree Distribution of Fountain Codes in the Finite-Length Regime
Fountain codes were introduced to provide higher reliability, lower complexities, and more scalability for networks such as the Internet. In this thesis, we study Luby- Transform (LT) codes which are the realization of ...
Trapping Sets in Fountain Codes over Noisy Channels
Fountain codes have demonstrated great results for the binary erasure channel and have already been incorporated into several international standards to recover lost packets at the application layer. These include multimedia ...