Guiasu and Picard [1] introduced the mean length for 'useful'codes. They called this length
as the 'useful'mean length. Longo [2] has proved a noiseless coding theorem for this …

A NEW UPPER BOUND ON CODES DECODABLE INTO SIZE-2 LISTS Page 1 A NEW UPPER
BOUND ON CODES DECODABLE INTO SIZE-2 LISTS Alexei Ashikhmin Los Alamos National …

PRoor. Let I be the maximum of the code word lengths for C. We may assume that C is
instantaneous. Thus by Theorem 1 l–1 is the only other possible code word length. Let s (0; …

Ashiq HUssain Bhat, Khalid Bashir and MAK Baig Department of Statistics, University of
Kashmir Srinagar, India Email: ashiqhb14@ gmail. com; khalidiyse3@ gmail. com; …

In this paper we define a two parametric new generalized useful average code-word length
$ L_ {\alpha}^{\beta} $(P; U) and its relationship with two parametric new generalized useful …

VA Zinov'ev, “On a Generalization of the Johnson Bound for Constant-Weight Codes”, Probl.
Peredachi Inf., 20:3 (1984), 105–108 Problemy Peredachi Informatsii RUS ENG JOURNALS …

It has been known since [Zyablov and Pinsker, 1982] that a random q-ary code of rate 1-H q
(ρ)-ε (where 0<; ρ<; 1-1/q, ε>; 0 is small enough and-H q (·) is the g-ary entropy function) with …

For a binary linear code, the pseudocodeword redundancy with respect to the additive white
Gaussian noise channel, the binary symmetric channel, or the max-fractional weight is …

The number of iterations of an iterative optimal or suboptimal decoding scheme for binary
linear block codes without any effect on its error performance can be reduced by testing a …

In this article we present a two parametric new generalized information measure and
corresponding to this new information measure, we define a new generalized average code …