Title :
The precise minimax redundancy
Author :
Drmota, Michael ; Szpankowski, Wojciech
Author_Institution :
Inst. fur Geometrie, Tech. Univ. Wien, Austria
Abstract :
A code Cn : 𝒜n → {0, 1} * is defined as a mapping from the set 𝒜n of all sequences x1n = (x1,..., xn) of length n over the finite alphabet 𝒜 to the set {0, 1}* of all binary sequences. Given a probabilistic source model, we let P(x1n) be the probability of the message x1n; given a code Cn, we let L(Cn,x1n) be the code length for x1n. The pointwise redundancy is defined as Rn(Cn,P;x1n)=L(Cn, x1n) + log P(x1n), while the average redundancy R~n (Cn, P) and the maximal redundancy Rn* (Cn, P) are defined.
Keywords :
binary sequences; information theory; minimax techniques; probability; redundancy; average redundancy; binary sequences; code length; finite alphabet; maximal redundancy; pointwise redundancy; precise minimax redundancy; probabilistic source model; probability distribution; sequences; Algorithm design and analysis; Computer science; Contracts; Entropy; Information analysis; Information theory; Minimax techniques; Particle measurements; Probability distribution; Stochastic processes;
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
DOI :
10.1109/ISIT.2002.1023307
