The expected codeword length L UD of the best uniquely decodable (UD) code satisfies H
(P; Q)≤ L UD< H (P; Q)+ 1, where H (P; Q) is the Kerridge inaccuracy. By applying the idea …

The information function e/sub h/of a code is the average amount of information contained in
h positions of the codewords. Upper and lower bounds on the information function of binary …

Theoretical bounds on the error-correcting capabilities of binary codes can be found for very
long codes in terms of k/n and t/n. It is pointed out that these bounds are only valid for very …

Bounds on the worst case probability of undetected error Page 1 29 8 IEEE TRANSACTIONS
ON INFORMATION THEORY, VOL. NO. I, JANUARY 1995 Bounds on the Worst Case …

Codes of variable length that are capable of error correction are studied. A lower bound on
the average length of such codes under the criterion of promptness is obtained. This …

Upper bounds to the maximum number of codewords in a binary code of length n and
asymmetric distance Delta are derived for some values of n and Delta. A method is given in …

Some limitations are given on the redundancy of D-ary codes with maximal codeword length
L. An upper bound that improves on a previous result of EN Gilbert (1971) is given. It is then …

Upper bounds for error detecting and error correcting codes are obtained in this paper. One
upper bound is found by exploiting the geometrical model of coding introduced by …

Hanning distance õ (u, v) between two code-words u and v is the number of positions in
which they differ. The Haming weight w (v) of a code-word v is the number of non-zero …

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 …