Recently, arithmetic coding has attracted the attention of many scholars because of its high compression capability. Accordingly, this paper proposed a Joint Source-Cryptographic-Channel Coding (JSCC) based on Arithmetic Coding (AC). For this purpose, embedded error detection arithmetic coding, which is known as continuous error detection (CED), is used. In our proposed method, a random length ...

A new approach of reliable image and video transmission over noisy channels is proposed. For subband decomposed image and video, combined source coding and channel modulation design can achieve high compression efficiency and preferable quality. Further performance gain is obtained by multiresolution modulation as well as a bit-remapping scheme that assigns efficient mapping from each source co...

– An MN-Gallager Code over Galois fields, q, based on the Dynamical Block Posterior probabilities (DBP) for messages with a given set of autocorrelations is presented with the following main results: a) for a binary symmetric channel the threshold, fc, is extrapolated for infinite messages using the scaling relation for the median convergence time, tmed ∝ 1/(fc− f); b) a degradation in the thre...

We describe a joint source/channel allocation scheme for transmitting images lossily over block erasure channels such as the Internet. The goal is to reduce image transmission latency. Our subband-level and bitplane-level optimization procedures give rise to an embedded channel coding strategy. Source and channel coding bits are allocated in order to minimize an expected distortion measure. Mor...

We describe a joint source/channel allocation scheme for transmitting images lossily over block erasure channels such as the Internet. The goal is to reduce image transmission latency. Our subband-level and bitplane-level optimization procedures give rise to an embedded channel coding strategy. Source and channel coding bits are allocated in order to minimize an expected distortion measure. Mor...

A novel concept of joint source-fountain coding for asynchronous wireless broadcast is presented. The traditional field of joint source-channel coding aims in both lossless data compression as well as reliable data delivery. Besides, fountain coding allows reliable broadcast without the need of feedback, and furthermore, asynchronous data access, i.e., each receiver is able to decide when it wa...

Images are usually transmitted across the Internet using a lossless protocol such as TCP/IP. Lossless protocols require retransmission of lost packets, which substantially increases transmission time. We introduce a fast lossy Internet image transmission scheme (FLIIT) for compressed images which uses forward error correction to eliminate retransmission delays. FLIIT couples an embedded quantiz...

MESHGRID is a scalable 3D object representation method which is part of MPEG-4 AFX. This paper proposes a new approach for optimized protection of MESHGRID-represented objects against transmission errors occurring over error-prone channels. An unequal error protection approach is followed, to cope with the different error-sensitivity levels characterizing the various resolution and quality laye...

With the rapid growth of data communication infrastructure, there has been an increasing demand for multimedia communication services over the past years. This rapid growth has posed new requirements and challenges in many related research areas. This dissertation studies the problem of efficient and robust transmission of image and video content over noisy channels. Firstly, joint source/chann...

Images are usually transmitted across the Internet using a lossless protocol such as TCP/IP. Lossless protocols require retransmission of lost packets, which substantially increases transmission time. We introduce a fast lossy Internet image transmission scheme (FLIIT) for compressed images which uses forward error correction to eliminate retransmission delays. FLIIT couples an embedded quantiz...