DocumentCode
2623139
Title
Context allocation with application to data compression
Author
Franaszek, Peter ; Thomas, Joy ; Tsoucas, Pantelis
Author_Institution
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
fYear
1994
fDate
27 Jun-1 Jul 1994
Firstpage
12
Abstract
Given a sequence of correlated symbols of a finite alphabet, the context or history of a substring (the sequence of symbols preceding the substring) provides information about likely future symbols for applications such as universal data compression or prediction. In this paper, we describe an approach to calculating optimal context and provide an application to a generalization of Lempel-Ziv coding
Keywords
correlation methods; data compression; sequences; source coding; Lempel-Ziv coding; context allocation; correlated symbols; finite alphabet; history; sequence; source coding; substring; universal data compression; Data compression; Dictionaries; Dynamic programming; Frequency estimation; History; State estimation;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location
Trondheim
Print_ISBN
0-7803-2015-8
Type
conf
DOI
10.1109/ISIT.1994.394959
Filename
394959
Link To Document