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

We show that the problem of code construction for multiple access channel (MAC) resolvability can be reduced to simpler source resolvability. Specifically, we propose a MAC relies on combination codes, used in black-box manner, and leverages randomness recycling implemented via distributed hashing block-Markov coding. Since explicit codes are known, our results also yield first coding schemes a...

The error exponent of Markov channels with feedback is studied in the variablelength block-coding setting. Burnashev’s [5] classic result is extended and a single letter characterization for the reliability function of finite-state Markov channels is presented, under the assumption that the channel state is causally observed both at the transmitter and at the receiver side. Tools from stochasti...

The discrete-time Gauss-Markov process is commonly used as a model in many source coding applications. A highly correlated Gauss-Markov process models the intensity along the motion trajectories encountered in time varying image coding. We investigate the rate-distortion performance of lossy coding schemes operating on such sources in the practically important low bit-rate region of less than o...

Fixed block size fractal coding is evaluated for rst-order Gauss-Markov models, and the eeects of varying the correlation are presented. Performance for this class of statistical models is found to be poor compared with traditional techniques such as transform coding.

Fixed block size fractal coding is evaluated for first-order Gauss-Markov models, and the effects of varying the correlation are presented. Performance for this class of statistical models is found to be poor compared with traditional techniques such as transform coding.

In this paper, we study the symmetry of polar codes on symmetric binary-input discrete memoryless channels (B-DMC). The symmetry property of polar codes is originally pointed out in Arikan’s work for general B-DMC channels. With the symmetry, the output vector y 1 (N be the block length) can be divided into equivalence classes in terms of their transition probabilities. In this paper, we presen...

Vector quantization (VQ) is a powerful and effective scheme that is widely used in speech and image coding applications. Two basic problems can he associated with VQ: (1) its large encoding complexity, and (2) its sensitivity to channel errors. These two problems have been independently studied in the past. These two problems are examined jointly. Specifically, the performances of two low-compl...