If we consider codes that are not necessarily uniquely decodable, then we can encode above the information capacity of the channel. It is important to note however that the probability of error for non-uniquely decodable codes when transmitting strings of source symbols can never approach 0. Consider the following example, we have a binary symmetric channel with cross over problem as shown in F...

Tandem source-channel coding is proven to be optimal by Shannon given unlimited delay and complexity in the coders. Under low delay and low complexity constraints, joint source-channel coding may achieve better performance. Although digital joint source-channel coding has shown a noticeable gain in terms of reconstructed signal quality, coding delay, and complexity, it suffers from the leveling...

In this paper we propose a joint source-channel coding scheme for transmission of images over noisy channels. In this scheme, the interaction between the source coding and the channel coding is through a small number of parameters. A robust source coder based on classiication of coeecients of Discrete Wavelet Transform of the image is coupled with a exible error control scheme which uses a bank...

We consider the problem of transmitting a Gaussian source on a slowly fading Gaussian channel, subject to the mean squared error distortion measure. The channel state information is known only at the receiver but not the transmitter. The source is assumed to be encoded in a successive refinement manner, and then transmitted over the channel using the broadcast strategy. In order to minimize the...

In this letter, we present a fixed-length robust joint source-channel coding (RJSCC) scheme for transmitting images over wireless channels. The system integrates a joint source-channel coding (JSCC) scheme with all-pass filtering source shaping to enable robust image transmission. In particular, we are able to incorporate both transition probability and bit error rate of a bursty channel model ...

In this work we show how source coding with decoder side-information (Wyner-Ziv problem) and channel coding with encoder side-infotmation (Gel’fand-Pinsker problem) can be merged into a single joint source/channel scheme in the quadratic Gaussian case (where the channel is known as the dirty paper channel). This scheme achieves the optimal performance RWZ(D) = CDPC without using any information...

Considering the fact that sensors are energy-limited and the wireless channel conditions in wireless sensor networks, there is an urgent need for a low-complexity coding method with high compression ratio and noise-resisted features. This paper reviews the progress made in distributed joint source-channel coding which can address this issue. The main existing deployments, from the theory to pra...

In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...

A novel scheme for joint source/channel coding of still images is proposed. By using efficient lapped transforms, channel-optimized robust quantizers and classification methods we show that significant improvements over traditional source/channel coding of images can be obtained while keeping the complexity low.