Given a probability vector, Huffman coding finds a corresponding prefix-free binary code that minimizes the mean codeword length. In this paper we explore situations in which the goals are different from those in Huffman coding. We explore a family of penalties (generalized means) proposed by Campbell [8], finding redundancy bounds for a common subfamily. We generalize an efficient algorithm fo...

The aim of source coding is to represent information as accurately as possible using as few bits as possible and in order to do so redundancy from the source needs to be removed. The aim of channel coding is in some sense the contrary, namely to introduce redundancy that can be exploited to protect the information when being transmitted over a nonideal channel. Combining these two techniques le...

We reexamine the problem of Multiple Description coding considered last week. We briefly review the import concepts and results. An overview of the basic methods of proof are provided. We further formulate this problem in the context of distributed source coding and from this framework examine a practical coding scheme for the symmetric problem provided by Pradhan et. al.

This letter describes a practical Slepian-Wolf source coding scheme based on Low Density Parity Check (LDPC) codes. It considers the realistic setup where parameters of statistical model between and side information are unknown. A novel Self-Corrected Belief-Propagation (SC-BP) algorithm is proposed in order to make robust incorrect by introducing some memory inside LDPC decoder. Two Dimensiona...

entropy coding, tree codes, adaptive coding This report presents an introduction to efficient adaptive compression using parameterized prefix codes. Advanced adaptive coding techniques can be quite complex because of the need to reliably estimate the probability of a large number of data symbols, each in a number of coding contexts, and then create the codes for each context, and finally code t...