The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Propomos uma variação do algoritmo Context Tree Weighting para fonte de árvore modificada de forma que o crescimento do contexto se assemelhe à análise Lempel-Ziv. Analisamos este algoritmo, fornecemos um limite superior conciso para a redundância individual para qualquer fonte de árvore e provamos a otimização assintótica da taxa de compressão de dados para qualquer fonte estacionária e ergódica.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Tsutomu KAWABATA, Frans M. J. WILLEMS, "A Context Tree Weighting Algorithm with an Incremental Context Set" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 10, pp. 1898-1903, October 2000, doi: .
Abstract: We propose a variation of the Context Tree Weighting algorithm for tree source modified such that the growth of the context resembles Lempel-Ziv parsing. We analyze this algorithm, give a concise upper bound to the individual redundancy for any tree source, and prove the asymptotic optimality of the data compression rate for any stationary and ergodic source.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_10_1898/_p
Copiar
@ARTICLE{e83-a_10_1898,
author={Tsutomu KAWABATA, Frans M. J. WILLEMS, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Context Tree Weighting Algorithm with an Incremental Context Set},
year={2000},
volume={E83-A},
number={10},
pages={1898-1903},
abstract={We propose a variation of the Context Tree Weighting algorithm for tree source modified such that the growth of the context resembles Lempel-Ziv parsing. We analyze this algorithm, give a concise upper bound to the individual redundancy for any tree source, and prove the asymptotic optimality of the data compression rate for any stationary and ergodic source.},
keywords={},
doi={},
ISSN={},
month={October},}
Copiar
TY - JOUR
TI - A Context Tree Weighting Algorithm with an Incremental Context Set
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1898
EP - 1903
AU - Tsutomu KAWABATA
AU - Frans M. J. WILLEMS
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2000
AB - We propose a variation of the Context Tree Weighting algorithm for tree source modified such that the growth of the context resembles Lempel-Ziv parsing. We analyze this algorithm, give a concise upper bound to the individual redundancy for any tree source, and prove the asymptotic optimality of the data compression rate for any stationary and ergodic source.
ER -