The problem of minimal expense coding (in particular for Rényi entropies, including the Shannon entropy) is discussed, and a new lower bound for the average cost of encoding the messages to be transmitted is obtained
Abstract. We will discuss entropy from the perspective of infor-mation theory. 1. Some coding termin...
[[abstract]]In this correspondence, we consider one-to-one encodings for a discrete memoryless sourc...
International audienceWe discuss the interest of escort distributions and Rényi entropy in the conte...
The problem of minimal expense coding (in particular for Rényi entropies, including the Shannon entr...
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 length of order α, has been defined and its relationship wit...
An inequality concerning Kullback's I-divergence is applied to obtain a necessary condition for the ...
We introduce a quantity which is called Rényi’s-Tsalli’s entropy of order ξ and discussed some of it...
A new measure Lβα, called average code word length of order α and type β is defined and its relation...
Variable-length noiseless coding of sequences of length n produced by a discrete memoryless source i...
Huffman's algorithm gives optimal codes, as measured by average codeword length, and the redundancy ...
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of dis...
The problem of constructing minimum-redundancy prefix codes for the general discrete noiseless chann...
Data compression is a fundamental problem in quantum and classical information theory. A typical ver...
Based on the problem of quantum data compression in a lossless way, we present here an operational i...
Abstract. We will discuss entropy from the perspective of infor-mation theory. 1. Some coding termin...
[[abstract]]In this correspondence, we consider one-to-one encodings for a discrete memoryless sourc...
International audienceWe discuss the interest of escort distributions and Rényi entropy in the conte...
The problem of minimal expense coding (in particular for Rényi entropies, including the Shannon entr...
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 length of order α, has been defined and its relationship wit...
An inequality concerning Kullback's I-divergence is applied to obtain a necessary condition for the ...
We introduce a quantity which is called Rényi’s-Tsalli’s entropy of order ξ and discussed some of it...
A new measure Lβα, called average code word length of order α and type β is defined and its relation...
Variable-length noiseless coding of sequences of length n produced by a discrete memoryless source i...
Huffman's algorithm gives optimal codes, as measured by average codeword length, and the redundancy ...
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of dis...
The problem of constructing minimum-redundancy prefix codes for the general discrete noiseless chann...
Data compression is a fundamental problem in quantum and classical information theory. A typical ver...
Based on the problem of quantum data compression in a lossless way, we present here an operational i...
Abstract. We will discuss entropy from the perspective of infor-mation theory. 1. Some coding termin...
[[abstract]]In this correspondence, we consider one-to-one encodings for a discrete memoryless sourc...
International audienceWe discuss the interest of escort distributions and Rényi entropy in the conte...
DOI
Add to ORKG