Tipo
Artículo de journal
Año
2004
ISSN
0018-9448
Páginas
1442
Número
7
Volúmen
50
Abstract
Autores
Citekey
1306544
doi
10.1109/TIT.2004.830763
Keywords
finite-memory processes
source coding
generalized context trees
Decoding
optimal context selection rule
Information theory
reversible transform
suffix trees
time reversal
Encoding
Tree data structures
Data compression
Data Structures
computational complexity
finite state machines
linear codes
Displays
finite-state machine
Context modeling
linear time universal coding
Laboratories
tree sources
Costs
FSM closure tree models