A joint source-channel coding scheme (JSCCS) used in applications, like sending images, voice, music etc. over internet/ wireless networks, involves source coding to compress the information and channel coding to detect/ correct errors, introduced by the channel. In this paper, we investigate the unequal error protection (UEP) capability of a class of low-density parity-check (LDPC) codes in a ...

A general multi-terminal source code and a general multi-terminal channel code are presented. Constrainedrandom-number generators with sparse matrices, are used in the construction of both encoders and decoders. Achievable regions for source coding and channel coding are derived in terms of entropy functions, where the capacity region for channel coding provides an alternative to the region of ...

Considering a small image region and specifying a joint probability distribution which describes the likelihood of nding a speciic pattern in this image region, arithmetic coding can provide an optimum code that reaches the Shannon limit for the given probability distribution. Data compression is thus reduced to estimating joint probability distributions of patterns. This paper demonstrates how...

Various Markov encoding and decoding techniques are often proposed for specific channels, e.g., the multi-access channel (MAC) with feedback, the relay channel, the MAC with cribbing encoders [1], [2], [3]. The goal of this report is to summarize the basic ideas of some block Markov coding techniques and present them using two simple channels, namely the point-to-point channel and the relay cha...

The aim of this, and of the follow-up paper [16], is to present the mathematics used in the technical field of speech coding. This paper remains mostly within a ,,classical" source coding theory based on alphabetic distortion measures. We prove a new general joint source/channel coding theorem for these measures. By an example of two users we demonstrate that the "classical" theory, which is in...

We present a scheme for joint source-channel coding for transmission of sources compressed by embedded source coders over a memoryless noisy channel. We nd an exact solution to the problem of optimal channel code allocation. Then we investigate the properties of the solution which allow us to transmit the source progressively while retaining the optimality at intermediate and nal transmission r...

These lecture notes on channel coding were developed for a one-semester course for graduate students of electrical engineering. Chapter 1 reviews the basic problem of channel coding. Chapters 2–5 are on linear block codes, cyclic codes, Reed-Solomon codes, and BCH codes, respectively. The notes are self-contained and were written with the intent to derive the presented results with mathematical...

In this paper, we propose a scheme for the optimal allocation of power, source coding rate, and channel coding rate for each of the nodes of a wireless Direct Sequence Code Division Multiple Access (DS-CDMA) visual sensor network. The optimization is quality-driven, i.e. the received quality of the video that is transmitted by the nodes is optimized. The scheme takes into account the fact that ...

The fundamental limits of “systematic” communication are analyzed. In systematic transmission, the decoder has access to a noisy version of the uncoded raw data (analog or digital). The coded version of the data is used to reduce the average reproduced distortion D below that provided by the uncoded systematic link and/or increase the rate of information transmission. Unlike the case of arbitra...

The FlexCode project is a joint research project of KTH Stockholm, RWTH Aachen University, Ericsson AB, Nokia Siemens Networks, and Orange/France Telecom under the umbrella of the sixth framework programme of the European Commission (http://www.flexcode.eu). In this paper we present the channel coding approach used in the FlexCode project. Furthermore, a brief introduction to the channel model ...