Hierarchical source coding, also known as successive refinement of information, was introduced by Koshelev [1,2] and Equitz and Cover [3]. This problem is concerned with the construction of a source code for a discrete memoryless source X with respect to a given distortion measure d1 that can be further refined to represent the same source within another distortion measure d2 so that both repre...

A novel embedded wavelet coding scheme is proposed for the transmission of images over unreliable channels. The proposed scheme is based on the partitioning of information into a number of layers which can be decoded independently provided that some important and highly protected information is initially errorlessly transmitted to the decoder. Forward error correction is used in conjunction wit...

An optimal joint source-channel coding (OJSCC) scheme is developed for encoding memoryless generalized Gaussian distribution (GGD) sources and transmission over noisy channels, including memoryless channels and bursty channels. In particular, we are able to incorporate both transition probability and bit error rate of a bursty channel model into an end-to-end rate-distortion (R-D) function. Thi...

This report is a summary of the issue of separation and code design for network data transmission environments, as discussed in the paper by Effros et al. [1]. It is often considered that the failure of source-channel separation in network environments is a crucial obstacle in applying information theoretic tools in networks. However, with a consistent framework for digital networks, the source...

The issue of robust and joint source-channel decoding of quasi-arithmetic codes is addressed. Quasi-arithmetic coding is a reduced precision and complexity implementation of arithmetic coding. This amounts to approximating the distribution of the source. The approximation of the source distribution leads to the introduction of redundancy that can be exploited for robust decoding in presence of ...

In this paper, a Bose-Chaudhuri-Hocquenghem (BCH) coder in the field of the real numbers is investigated for simultaneous source coding and impulse noise cancellation of satellite images. Our channel is a binary symmetric channel (BSC). Our approach is to make a carefully designed interpolation of the subband images prior to quantization and transmission. Compared to a classical tandem source a...

In this paper we propose a low-complexity errorresilient and joint source-channel video coding algorithms for video codec based on three-dimensional discrete wavelet transform (3-D DWT). First, we show that the video stream, generated by 3-D DWT codec with the proposed error-resilient, is significantly more robust to packet losses than video stream generated by scalable extension of the H.264/A...

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

Recently, the wireless communication requires robust and spectrally efficient communication techniques for fading channel. Thus, for reliable communication, this paper proposes the enhanced adaptive modulation coding in the cooperative communication. The proposed scheme uses modulation coding according to the channel state. When the channel can be estimated and this estimate sent back to the tr...