On Finite Memory Universal Data Compression and Classification of Individual Sequences

Consider the case where consecutive blocks of letters of a semi-infinite individual sequence over a finite-alphabet are being compressed into binary sequences by some one-to-one mapping. No a priori information about is available at the encoder, which must therefore adopt a universal data-compressio...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory Jg. 54; H. 4; S. 1626 - 1636
1. Verfasser:	Ziv, J.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY IEEE 01.04.2008 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Applied sciences Binary sequences Biological system modeling Classifiers Coding, codes Compressing Compression algorithms Computational biology Context-tree coding Data compression Data transmission Encoders Exact sciences and technology H infinity control Information analysis Information processing Information theory Information, signal and communications theory Jacobian matrices Mathematical analysis Signal and communications theory Signal representation. Spectral analysis Signal, noise Telecommunications and information theory Testing Training Turing machines universal classification universal compression Alphabet Automatic classification Probabilistic approach Lempel Ziv algorithm Data compression Context tree Mapping universal compression Signal classification Discriminator Learning Binary sequence Space complexity Context-tree coding Coding A priori estimation universal classification
ISSN:	0018-9448, 1557-9654
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!