In this work, we investigate the joint source-channel coding problem of transmitting non-uniform memoryless sources over wireless Rayleigh fading channels via Turbo codes. The source redundancy in the form of non-uniformity is exploited in the Turbo decoder by incorporating the source statistics in the modified extrinsic information. In contrast to previous work, non-systematic recursive convol...

An integrated framework of optimal rate allocation for video coding is presented in the case of transmission over wireless channels without feedback channels. For a fixed channel bit rate and finite number of channel coding rate, the proposed scheme can find the optimal source and channel coding pair and corresponding robust video coding scheme such that the expected end-to-end distortion of vi...

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 ...

WYNER-ZIV Coding, distributed coding, Laplacian sources, arithmetic coding, channel coding A large number of practical coding scenarios deal with sources such as transform coefficients that can be well modeled as Laplacians. For regular coding of such sources, samples are often quantized by a family of uniform quantizers possibly with a deadzone, and then entropy coded. For the Wyner-Ziv coding...

The information reconciliation in a quantum key distribution protocol can be studied separately from other steps in the protocol. The problem of information reconciliation can be reduced to that of distributed source coding. Its solution by LDPC codes is reviewed. We list some obstacles preventing the LDPC-based distributed source coding from becoming a more favorable alternative to the Cascade...

All traditional data compression techniques, such as Huffman coding, the Lempel-Ziv algorithm, run-length limited coding, Tunstall coding and arithmetic coding are highly susceptible to residual channel errors and noise. We have recently proposed the use of parallel concatenated codes and iterative decoding for fixed-length to fixed-length source coding, i.e., turbo coding for data compression ...

We consider the problem of making distributed computations robust to noise, in particular to worst-case (adversarial) corruptions of messages. We give a general distributed interactive coding scheme which simulates any asynchronous distributed protocol while tolerating a maximal corruption level of Θ(1/n)-fraction of all messages. Our noise tolerance is optimal and is obtained with only a moder...

In this paper, communication of a Multivariate Gaussian over a Gaussian Multiple Access Channel is studied. Distributed zero-delay joint source-channel coding (JSCC) solutions to the problem are given. Both nonlinear and linear approaches are discussed. The performance upper bound (signalto-distortion ratio) for arbitrary code length is also derived and Zero-delay cooperative JSCC is briefly ad...

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.

Most of the conventional communication systems use channel interleaving as well as hard decision decoding in their designs, which lead to discarding channel memory and soft-decision information. This simplification is usually done since the complexity of handling the memory or soft-decision information is rather high. In this work, we design two lossy joint source-channel coding (JSCC) schemes ...