DOIAbstract
A new measure L(α), called average code length of order α, has been defined and its relationship with Rényi's entropy has been discussed. Using L(α), a coding theorem for discrete noiseless channels has been proved
A new measure L(α), called average code length of order α, has been defined and its relationship with Rényi's entropy has been discussed. Using L(α), a coding theorem for discrete noiseless channels has been proved
In this correspondence we provide new bounds on the expected length L of a binary one-to-one code fo...
An inequality concerning Kullback's I-divergence is applied to obtain a necessary condition for the ...
The problem of minimal expense coding (in particular for Rényi entropies, including the Shannon entr...
Abstract. A new measure L β α, called average code word length of order α and type β has been define...
A new measure,L called average code word length of order is defined and its relationship with ...
ABSTRACT. Guiasu and Picard [I] introduced the mean length for ’useful ’ codes. They called this len...
A new measure L(α), called average code length of order α, has been defined and its relationship wit...
We introduce a quantity which is called Rényi’s-Tsalli’s entropy of order ξ and discussed some of it...
Let L(t) = t−1logD(∑piDtni})where pi is the probability of the ith input symbol to a noiseless chann...
A new measure Lβα, called average code word length of order α and type β is defined and its relation...
We present a relation between Tsallis’s entropy and generalized Kerridge inaccuracy which is called ...
For a generalized random variable X, a measure L¯X of average code length is defined. Using L¯X, som...
The objective of the present communication is to develop new genuine exponentiated mean codeword len...
The field of information science has greatly developed, and applications in various fields have emer...
International audienceWe discuss the interest of escort distributions and Rényi entropy in the conte...
In this correspondence we provide new bounds on the expected length L of a binary one-to-one code fo...
An inequality concerning Kullback's I-divergence is applied to obtain a necessary condition for the ...
The problem of minimal expense coding (in particular for Rényi entropies, including the Shannon entr...
Abstract. A new measure L β α, called average code word length of order α and type β has been define...
A new measure,L called average code word length of order is defined and its relationship with ...
ABSTRACT. Guiasu and Picard [I] introduced the mean length for ’useful ’ codes. They called this len...
A new measure L(α), called average code length of order α, has been defined and its relationship wit...
We introduce a quantity which is called Rényi’s-Tsalli’s entropy of order ξ and discussed some of it...
Let L(t) = t−1logD(∑piDtni})where pi is the probability of the ith input symbol to a noiseless chann...
A new measure Lβα, called average code word length of order α and type β is defined and its relation...
We present a relation between Tsallis’s entropy and generalized Kerridge inaccuracy which is called ...
For a generalized random variable X, a measure L¯X of average code length is defined. Using L¯X, som...
The objective of the present communication is to develop new genuine exponentiated mean codeword len...
The field of information science has greatly developed, and applications in various fields have emer...
International audienceWe discuss the interest of escort distributions and Rényi entropy in the conte...
In this correspondence we provide new bounds on the expected length L of a binary one-to-one code fo...
An inequality concerning Kullback's I-divergence is applied to obtain a necessary condition for the ...
The problem of minimal expense coding (in particular for Rényi entropies, including the Shannon entr...
Add to ORKG