This paper discusses noisy index coding problem over Gaussian broadcast channel. We propose a technique for mapping the index coded bits to M-QAM symbols such that the receivers whose side information satisfies certain conditions get coding gain, which we call the QAM side information coding gain. We compare this with the PSK side information coding gain, which was discussed in [1]. Keywords—In...

This thesis explore dynamics in source coding and channel coding. We begin by introducing the idea of distortion side information, which does not directly depend on the source but instead affects the distortion measure. Such distortion side information is not only useful at the encoder but under certain conditions knowing it at the encoder is optimal and knowing it at the decoder is useless. Th...

We explore the connection between channel and source coding problems. Our study centers on the class of binning schemes that characterize the largest known achievable rates for channel and source coding problems with partial side information and multiterminal scenarios. The binning scheme can be viewed as a set of bins with each bin forming a channel code (with error probability 22) and set of ...

It has recently been shown that for an image or video transmission scheme to be both eecient and robust in practice that a joint source-channel coding approach is necessary. In this work, we discuss recent eeorts in the eld of joint source-channel coding of images and video. We then present a general methodology for determining the optimal tradeoo between source and channel coding as a function...

Distributed speech recognition (DSR) is motivated by the fact that codecs used in speech transmission usually reveal a degrading voice quality below some channel quality (carrier-to-interferer ratio C/I), which justifies efficient coding of features with an appropriate channel coding in the mobile terminal. The Adaptive MultiRate (AMR) speech codec standardized for GSM and UMTS however delivers...

A key benefit of channel coding is the ability to protect data against channel impairments. Essentially, the channel coder adds redundancy bits that provide a way to correct corrupted data. Encryption is another way of protecting data against channel impairments and unintended interception or forging. This paper introduces an efficient approach of increasing coding gain at the receiver end. The...

We derive universal classical-quantum superposition coding and multiple access channel by using generalized packing lemmas for the type method. Using our code, we establish capacity region of a compound broadcast with degraded message sets. Our codes have two types codes. One is code joint decoding other separate decoding. It not so easy to construct former that universally achieves general poi...

Classical coding schemes that rely on joint typicality (such as Slepian-Wolf coding and channel coding) assume known statistics and rely on asymptotically long sequences. However, in practice the statistics are unknown, and the sequences are of finite length n. In this finite regime, we must allow a non-zero probability of coding error and also pay a penalty by transmitting extra bits. The pena...

This article presents methods for robust and efficient communication over wireless channels. Both benefits and limitations of the classical approach of separate source and channel coding are discussed. Joint source-channel coding (JSCC) is presented as the most promising scheme for communication of analogue sources over wireless channels, due to its ability to cope with varying channel qualitie...