DocumentCode
2001699
Title
Precise minimax redundancy for Markov sources
Author
Jacquet, Philippe ; Szpankowski, Wojciech
Author_Institution
Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay, France
fYear
2003
fDate
29 June-4 July 2003
Firstpage
78
Abstract
We approach the problem of finding Nk from the generating point of view. We first redefine the pair-occurence matrix on cyclic strings. We define Nkba as the number of cyclic strings starting with symbol a and ending with symbol b with the pair occurrence matrix k.
Keywords
Markov processes; cyclic codes; minimax techniques; Markov source; cyclic string; pair-occurence matrix; precise minimax redundancy; Binary sequences; Computer science; Information theory; Minimax techniques; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN
0-7803-7728-1
Type
conf
DOI
10.1109/ISIT.2003.1228092
Filename
1228092
Link To Document