In this correspondence, we consider one-to-one encodings for a discrete memoryless
source, which are" one-shot" encodings associating a distinct codeword with each source …

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 …

In the present communication, we have obtained the optimum probability distribution with
which the messages should be delivered so that the average redundancy of the source is …

Let d_1 (α, β) be a distortion measure that is row balanced if the source alphabet is a finite
set and that has the form d (α-β) if the source alphabet is the real line. For N-tuples, let the …

In this manuscript we develop a new generalized entropy measure and corresponding to
this measure we also develop a new generalized average code-word length and find the …

In this paper, the average probability distribution P~/sup N/~ of equiprobable finite monotone
sources, where N is the number of symbols, is derived and some properties of this …

Abstract Let R=(r 1, r 2,...) be an infinite sequence of real numbers (0< ri< 1). For a binary
word (a bit sequence) w of length n, let¦ w¦ R denote the value “-log 2 (the probability that n …

The tight lower bound on the redundancy of optimal prefix-free codes in terms of a given
symbol probability (not necessarily the largest or the smallest one) has been derived in the …

For a given set of N symbols to be coded by a code of alphabet size D, the necessary and
sufficient conditions for the optimality of a block code of length m, if N= D^ m, and the …

A linear code of block length n possessing minimum weight d has one code word of weight
zero, and no other code words of weight less than d. The weight distribution of the code is …