ABSTRACT A source code C is considered containing K codewords with lengths wi, 1≤ i≤
K, respectively, where K is a non negative integer. The capacity C of a source code is …

In this paper we propose a revisitation of the topic of unique decodability and of some of the
related fundamental theorems. It is widely believed that, for any discrete source X, every …

In this paper, we propose a revisitation of the topic of unique decodability and of some
fundamental theorems of lossless coding. It is widely believed that, for any discrete source X …

New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities Page 1
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-%, NO. 2, MARCH 1977 157 …

The source coding theorem assigns an operational meaning to the entropy, ie to the
expectation of the self-information. It states, roughly speaking, that the entropy of a discrete …

Shannon information measure has a very concrete operational interpretation: it roughly
equals the minimum number of binary digits needed, on the average, to encode the …

In order to determine how suboptimal the Shannon code is, one should compare its
performance with that of the optimal code, ie, the corresponding Huffman code, in some …

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 twist to the classical problem of compressing a discrete source over noiseless
channel alphabets where different code symbols may have different transmission costs is …

Two new mean codeword lengths L (α, β) and L (β) are defined and it is shown that these
lengths satisfy desirable properties as a measure of typical codeword lengths. Consequently …