Interpretation of the Lempel-Ziv complexity measure in the context of biomedical signal analysis
Lempel-Ziv complexity (LZ) and derived LZ algorithms have been extensively used to solve
information theoretic problems such as coding and lossless data compression. In recent …
information theoretic problems such as coding and lossless data compression. In recent …
Compression of low entropy strings with Lempel--Ziv algorithms
SR Kosaraju, G Manzini - SIAM Journal on Computing, 2000 - SIAM
We compare the compression ratio of the Lempel--Ziv algorithms with the empirical entropy
of the input string. This approach makes it possible to analyze the performance of these …
of the input string. This approach makes it possible to analyze the performance of these …
Entropy computations via analytic depoissonization
P Jacquet, W Szpankowski - IEEE Transactions on Information …, 1999 - ieeexplore.ieee.org
We investigate the basic question of information theory, namely, evaluation of Shannon
entropy, and a more general Renyi (1961) entropy, for some discrete distributions (eg …
entropy, and a more general Renyi (1961) entropy, for some discrete distributions (eg …
[PDF][PDF] Entropy computations via analytic depoissonization
P Jacquet, W Szpankowski - 1996 - docs.lib.purdue.edu
Abstract Wojciech Szpankowskit Department of Computer Science Purdue University W.
Lafayette, IN 47907 UB. A. spa@ cs. purdue. edu We investigate the basic question of …
Lafayette, IN 47907 UB. A. spa@ cs. purdue. edu We investigate the basic question of …
A post-processing for the enumerative code implementation of Ziv-Lempel incremental parsing
T Kawabata - IEICE transactions on communications, 2007 - search.ieice.org
Ziv-Lempel incremental parsing [1] is a fundamental algorithm for lossless data
compression. There is a simple enumerative implementation [7] which preserves a duality …
compression. There is a simple enumerative implementation [7] which preserves a duality …
A note on a sequence related to the Lempel-Ziv parsing
T Kawabata - IEICE transactions on fundamentals of electronics …, 2000 - search.ieice.org
A Note on a Sequence Related to the Lempel-Ziv Parsing Page 1 IEICE TRANS.
FUNDAMENTALS, VOL.E83–A, NO.10 OCTOBER 2000 1979 LETTER Special Section on …
FUNDAMENTALS, VOL.E83–A, NO.10 OCTOBER 2000 1979 LETTER Special Section on …
[PDF][PDF] jacquet@ blagny. inria. fr spa@ cs. purdue. edu
ECVIAA DEPOISSONIZATION - 1998 - Citeseer
We investigate the basic question of information theory, namely, evaluation of Shannon
entropy, and a more general R enyi entropy, for some discrete distributions (eg, binomial …
entropy, and a more general R enyi entropy, for some discrete distributions (eg, binomial …
Exact analysis of the Lempel-Ziv algorithm for unifilar Markov source
T Kawabata - … of 1994 IEEE International Symposium on …, 1994 - ieeexplore.ieee.org
We find an exact formula of the expected length of the i-th parsed segment on a state
dependent parsing tree which results from the state dependent Lempel-Ziv incremental …
dependent parsing tree which results from the state dependent Lempel-Ziv incremental …
A Post-Processing Mechanism for SequentialUse of Static and Dynamic Enumerative Code
T Kawabata - 電気通信大学紀要, 2007 - uec.repo.nii.ac.jp
A bijection between a complete set of source words and a complete set of codewords
defines a variable-to-variable length (VV) source code. Such code is used to parse …
defines a variable-to-variable length (VV) source code. Such code is used to parse …