We focus on a trellis-based decoding technique for variable length codes (VLCs) which
does not require any additional side information besides the number of bits in the coded …

In this paper we describe a trellis representation of variable length coded data which is
capable of being used for bit-level or symbol-level maximum a posteriori (MAP) decoding of …

We show, both experimentally and theoretically, that sympathetic cooling of 87 Rb atoms in
the| F= 2, m F= 2> state by evaporatively cooled atoms in the| F= 1, m F=− 1> state can be …

Treats joint source and channel decoding in an integrated way Gives a clear description of
the problems in the field together with the mathematical tools for their solution Contains …

Recent developments such as the invention of powerful turbo-decoding and irregular
designs, together with the increase in the number of potential applications to multimedia …

Variable-length error-correcting codes, suitable to perform joint source-channel coding, are
presented. A maximum likelihood decoding algorithm for these codes is given. Some …

Most source coding standards (voice, audio, image and video) use Variable-Length Codes
(VLCs) for compression. However, the VLC decoder is very sensitive to transmission errors …

We present a new method for using a priori information at a bit level in the decoding of
Huffman codes. Its basic principle is the computation and use of the bit probabilities derived …

This paper considers VLC decoding algorithms based on MAP sequence estimation
techniques, using residual source redundancy to provide channel error correction. These …

We propose a generic algorithm for the construction of efficient reversible variable-length
codes (RVLCs) and variable-length error-correcting (VLEC) codes, which optimizes the …