Tipo
Paper de conferencia
Año
2004
ISSN
1068-0314
Páginas
372
Abstract
Autores
Citekey
1281482
doi
10.1109/DCC.2004.1281482
Keywords
Decoding
transforms
tree codes
Encoding
Data compression
Upper bound
BWT
Burrows-Wheeler transform
context deinterleaving feature
computational complexity
finite state machines
finite state machine closure
generalized context tree
linear time coding
Entropy
lossless coding scheme
linear codes
twice-universal coding
Automata
Displays
Context modeling
Laboratories
source coding