New lower bounds for constant weight codes Page 1 1324 IEEE TRANSACTIONS ON
INFORMATION THEORY, VOL. 35. NO. 6. NOVEMBER 1989 On the other hand, the effect of …

Let A (n, d) denote the maximum possible number of codewords in an (n, d) binary code. We
establish four new bounds on A (n, d), namely, A (21, 4)/spl les/43689, A (22, 4)/spl …

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 …

A (n, d, w) is the maximum size of a binary code with word length n, minimum distance d,
and constant weight w. The tables below give the best known lower (and upper) bounds for …

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 order to investigate the cost of employing fix-free codes instead of the well-established
prefix-free codes, some upper bounds on the redundancy of the optimal fix-free codes and …

In this research article we develop a new two parametric new generalized inaccuracy
measure I< sub> α< sup> β(P: Q) and a new two parametric generalized average code-word …

A lower bound on the redundancy of<tex>D</tex>-ary Huffman codes (Corresp.) Page 1 A
Lower Bound oti the Redundancy of D-ary Huffman Codes JOVAN DJ. GOLIe AND MILORAD …

Some new upper bounds for constant weight codes (Corresp.) Page 1 Some New Upper
Bounds for Constant Weight On the Rate-Distortion Function for the Nonstationary Codes …

A new lower bound for the mean code length of all one-to-one codes for a random variable
with n outcomes is derived. The bound, which is tight, improves an earlier one due to Leung …