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
Atualmente, o modelo mais popular na teoria da compressão de dados é o de fontes ergódicas estacionárias. Mas existem sequências, cada uma das quais não é emitida por nenhuma fonte ergódica estacionária, mas pode ser suficientemente comprimida por um determinado algoritmo. Estimamos o tamanho do conjunto dessas sequências em termos da dimensão de Hausdorff.
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
Kouki HOJO, Boris Ya. RYABKO, Joe SUZUKI, "Performance of Data Compression in Terms of Hausdorff Dimension" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 7, pp. 1761-1764, July 2001, doi: .
Abstract: Currently, the most popular model in data compression theory is that of stationary ergodic sources. But there do exist sequences each of which is not emitted from any stationary ergodic source but can be compressed sufficiently by a certain algorithm. We estimate the size of the set of such sequences in terms of Hausdorff dimension.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_7_1761/_p
Copiar
@ARTICLE{e84-a_7_1761,
author={Kouki HOJO, Boris Ya. RYABKO, Joe SUZUKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Performance of Data Compression in Terms of Hausdorff Dimension},
year={2001},
volume={E84-A},
number={7},
pages={1761-1764},
abstract={Currently, the most popular model in data compression theory is that of stationary ergodic sources. But there do exist sequences each of which is not emitted from any stationary ergodic source but can be compressed sufficiently by a certain algorithm. We estimate the size of the set of such sequences in terms of Hausdorff dimension.},
keywords={},
doi={},
ISSN={},
month={July},}
Copiar
TY - JOUR
TI - Performance of Data Compression in Terms of Hausdorff Dimension
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1761
EP - 1764
AU - Kouki HOJO
AU - Boris Ya. RYABKO
AU - Joe SUZUKI
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2001
AB - Currently, the most popular model in data compression theory is that of stationary ergodic sources. But there do exist sequences each of which is not emitted from any stationary ergodic source but can be compressed sufficiently by a certain algorithm. We estimate the size of the set of such sequences in terms of Hausdorff dimension.
ER -