| Summary: | In this thesis, we study the problem of sending a memoryless source over a memoryless broadcast channel, to two users that need to reconstruct the source subject to some distortion and delay constraints. Our motivation is to study the use of rateless codes for single-server broadcasting to diverse users, in an information theoretical way. We consider both analog and digital versions of this problem. When it is a binary source being sent over an erasure broadcast channel and the distortion is measured with the erasure distortion, we derive an inner bound for the achievable distortion region. If the distortion measure was instead the Hamming distortion, we derive an outer bound for the latency region. Finally, when it is a Gaussian source being sent over the Gaussian broadcast channel and the distortion is a quadratic measure, we provide an analogous inner bound for the distortion region.
|
|---|
