Add to ORKGAbstract. A new measure L β α, called average code word length of order α and type β has been defined and its relationship with a result of generalized Havrda-Charvat and Tsal-lis’s entropy has been discussed. Using L β α, some coding theorem for discrete noiseless channel has been proved. 1
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 ...
A new measure L(α), called average code length of order α, has been defined and its relationship wit...
A new measure Lβα, called average code word length of order α and type β is defined and its relation...
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...
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...
The field of information science has greatly developed, and applications in various fields have emer...
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...
A relation between Shannon entropy and Kerridge inaccuracy, which is known as Shannon inequality, is...
The objective of the present communication is to develop new genuine exponentiated mean codeword len...
An extension is presented to the source coding theorem traditionally based on the Shannon entropy an...
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 ...
A new measure L(α), called average code length of order α, has been defined and its relationship wit...
A new measure Lβα, called average code word length of order α and type β is defined and its relation...
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...
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...
The field of information science has greatly developed, and applications in various fields have emer...
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...
A relation between Shannon entropy and Kerridge inaccuracy, which is known as Shannon inequality, is...
The objective of the present communication is to develop new genuine exponentiated mean codeword len...
An extension is presented to the source coding theorem traditionally based on the Shannon entropy an...
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 ...