A new twist to the classical problem of compressing a discrete source over noiseless
channel alphabets where different code symbols may have different transmission costs is …

In 1973, Arimoto proved the strong converse theorem for the discrete memoryless channels
stating that when transmission rate R is above channel capacity C, the error probability of …

The goal of source coding is to encode the output of a discrete information source into a
sequence of letters from a given channel alphabet with the minimum expected cost required …

Shannon's analysis of the fundamental capacity limits for memoryless communication
channels has been refined over time. In this paper, the maximum volume M* avg (n,∈) of …

The Log-Volume of Optimal Codes for Memoryless Channels, Up to a Few Nats Page 1 The
Log-Volume of Optimal Codes for Memoryless Channels, Up to a Few Nats Pierre Moulin Dept …

This paper generalizes one-to-one encodings of a discrete random variable to finite code
alphabets with memoryless letter costs and establish some upper and lower bounds on the …

Although optimal binary source coding using symbol blocks of increasing length must
eventually yield a code having an average codeword length arbitrarily close to the source …

A new lower bound on the probability of decoding error for the case of rates above capacity
is presented. It forms a natural companion to Gallager's random coding bound for rates …

An improved upper bound on the block coding error exponent for binary-input discrete
memoryless channels (Corresp.) Page 1 CORRESPONDENCE Finally, we note that by taking M …

We address the problem of joint source-channel coding when variable-length codes are
used for information transmission over a discrete memoryless channel. Data transmitted …