DocumentCode
3069460
Title
Data compression using deterministic experts
Author
Balkenhol, Bernhard
Author_Institution
Fak. fur Math., Bielefeld Univ., Germany
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
422
Abstract
As an example of a problem in which data can be described by using experts we consider the storage and transmission of chess master games. The transmission of one move in a given situation may be done by coding this move itself or transmitting the number of the expert who proposes this move. We present a stochastic model for “data compression using deterministic experts” and prove some entropy-related upper and lower bounds
Keywords
Huffman codes; data compression; entropy; game theory; chess master games; coding; data compression; deterministic experts; entropy-related lower bounds; entropy-related upper bounds; stochastic model; storage; transmission; Artificial intelligence; Data compression; Decoding; Entropy; Mathematics; Probability distribution; Proposals; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613359
Filename
613359
Link To Document