Title :
Data compression using deterministic experts
Author :
Balkenhol, Bernhard
Author_Institution :
Fak. fur Math., Bielefeld Univ., Germany
fDate :
29 Jun-4 Jul 1997
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;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613359
