We provide new bounds on the expected length L of a binary one-to-one code for a discrete
random variable X with entropy H. We prove that L/spl ges/H-log (H+ 1)-Hlog (1+ 1/H). This …

The maximum number of codewords in a binary code with length n and minimum distance d
is denoted by A (n, d). By construction it is known that A (10, 3)/spl ges/72 and A (11, 3)/spl …

We consider upper bounds on two fundamental parameters of a code; minimum distance
and covering radius. New upper bounds on the covering radius of non-binary linear codes …

A new lower bound for the distance of cyclic codes is proposed. This bound depends on the
defining set of the code, like several other bounds. The proposed bound improves upon the …

We consider the problem of the best possible relation between the list decodability of a
binary linear code and its minimum distance. We prove, under a widely-believed number …

A method for deriving optimal upper bounds on the redundancy of binary Huffman codes in
terms of the probability p/sub 1/of the most likely source letter is presented. This method will …

The source coding problem is considered where the only information known about the
source is the number of symbols n and the order of the symbol probabilities. In this case, the …

Some new constant weight codes (Corresp.) Page 1 364 reference [l]. Further, this code is
the “best” (58,29) self-dual code [5]. In this code too, the number of codewords of weight i is …

One-to-one codes are ldquoone-shotrdquo codes that assign a distinct codeword to source
symbols and are not necessarily prefix codes (more generally, uniquely decodable) …

Exact evaluation of the Random coding Error probability and Error Exponent Page 1 Exact
evaluation of the Random coding Error probability and Error Exponent Nir Elkayam and …