On the public citation graph

Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression

0 signed · 252 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1090/s0002-9904-1947-08927-8openalex-snapshot
On the notion of recurrence in discrete stochastic processes
inferredcites →https://doi.org/10.1109/18.42176openalex-snapshot
Universal data compression and repetition times
inferredcites →https://doi.org/10.1109/tit.1975.1055349openalex-snapshot
Universal codeword sets and representations of the integers
inferredcites →https://doi.org/10.1109/tit.1978.1055934openalex-snapshot
Compression of individual sequences via variable-rate coding
inferredcites →https://doi.org/10.1145/322234.322237openalex-snapshot
Linear Algorithm for Data Compression via String Matching
inferredcites →https://doi.org/10.1214/aoms/1177705812openalex-snapshot
Correction Notes: Correction to "The Individual Ergodic Theorem of Information Theory"
inferredcites →https://doi.org/10.1214/aoms/1177706899openalex-snapshot
The Individual Ergodic Theorem of Information Theory

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/047174882x.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9781118032770.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9781119625384.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/ecjc.4430790810openalex-snapshot
An improvement in the pointer coding of LZ77 data compression method
inferred← citeshttps://doi.org/10.1002/rsa.10019openalex-snapshot
Convergence properties of functional estimates for discrete distributions
inferred← citeshttps://doi.org/10.1002/rsa.20500openalex-snapshot
Uncommon suffix tries
inferred← citeshttps://doi.org/10.1002/spe.698openalex-snapshot
Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem
inferred← citeshttps://doi.org/10.1007/3-540-54303-1_141openalex-snapshot
On the adaptive source coding
inferred← citeshttps://doi.org/10.1007/3-540-56024-6_1openalex-snapshot
Probabilistic analysis of generalized suffix trees
inferred← citeshttps://doi.org/10.1007/3-540-58094-8_9openalex-snapshot
A lossy data compression based on string matching: Preliminary analysis and suboptimal algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_184openalex-snapshot
Ergodic Theory: Recurrence
inferred← citeshttps://doi.org/10.1007/978-1-0716-2388-6_184openalex-snapshot
Ergodic Theory: Recurrence
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_23openalex-snapshot
Universal Discrimination of Individual Sequences via Finite-State Classifiers
inferred← citeshttps://doi.org/10.1007/978-1-4614-1806-1_23openalex-snapshot
Ergodic Theory: Recurrence
inferred← citeshttps://doi.org/10.1007/978-1-4615-2694-0_42openalex-snapshot
The Sliding-Window Lempel-Ziv Algorithm is Asymptotically Optimal
inferred← citeshttps://doi.org/10.1007/978-1-4757-2319-9_2openalex-snapshot
Coding for Discrete Noiseless Channels
inferred← citeshttps://doi.org/10.1007/978-3-032-17478-9_6openalex-snapshot
Measuring and Modelling the Production and Propagation of Information in the Public Information Environment
inferred← citeshttps://doi.org/10.1007/978-3-319-07155-8_2openalex-snapshot
Estimating Kolmogorov Entropy from Recurrence Plots
inferred← citeshttps://doi.org/10.1007/978-3-319-18781-5_4openalex-snapshot
Estimation of Entropy from Subword Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-24403-7_3openalex-snapshot
Complexity and Universality in the Long-Range Order of Words
inferred← citeshttps://doi.org/10.1007/978-3-540-72584-8_87openalex-snapshot
CARP: Context-Aware Resource Provisioning for Multimedia over 4G Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-73549-6_14openalex-snapshot
CHASE: Context-Aware Heterogenous Adaptive Smart Environments Using Optimal Tracking for Resident’s Comfort
inferred← citeshttps://doi.org/10.1007/978-3-642-02441-2_2openalex-snapshot
Quasi-distinct Parsing and Optimal Compression Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_184-3openalex-snapshot
Ergodic Theory: Recurrence
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_634-1openalex-snapshot
Lempel-Ziv Compression
inferred← citeshttps://doi.org/10.1007/978-3-662-48324-4_19openalex-snapshot
Predictive Models for Min-entropy Estimation
inferred← citeshttps://doi.org/10.1007/bf01066715openalex-snapshot
Waiting times: Positive and negative results on the Wyner-Ziv problem
inferred← citeshttps://doi.org/10.1007/bf02916754openalex-snapshot
Return times, recurrence densities and entropy for actions of some discrete amenable groups
inferred← citeshttps://doi.org/10.1007/bf02995720openalex-snapshot
Codage De Source Adaptatif Par I’Algorithme De Guazzo
inferred← citeshttps://doi.org/10.1007/s00220-024-04995-8openalex-snapshot
Large Deviations of Return Times and Related Entropy Estimators on Shift Spaces
inferred← citeshttps://doi.org/10.1007/s00332-015-9240-2openalex-snapshot
Searching for Targets of Nonuniform Size Using Mixing Transformations: Constructive Upper Bounds and Limit Laws
inferred← citeshttps://doi.org/10.1007/s00422-005-0552-4openalex-snapshot
Estimation of muscle spindle information rate by pattern matching and the effect of gamma system activity on parallel spindles
inferred← citeshttps://doi.org/10.1007/s00574-006-0030-1openalex-snapshot
Hitting, returning and the short correlation function
inferred← citeshttps://doi.org/10.1007/s10955-014-1185-6openalex-snapshot
The Almost Sure Invariance Principle for Beta-Mixing Measures
inferred← citeshttps://doi.org/10.1007/s10959-008-0199-xopenalex-snapshot
Sharp Error Terms for Return Time Statistics under Mixing Conditions
inferred← citeshttps://doi.org/10.1007/s10959-014-0579-3openalex-snapshot
Coalescence and Meeting Times on $$n$$ n -Block Markov Chains
inferred← citeshttps://doi.org/10.1007/s11005-023-01640-8openalex-snapshot
Recurrence times, waiting times and universal entropy production estimators
inferred← citeshttps://doi.org/10.1007/s11425-014-4854-7openalex-snapshot
The waiting spectra of the sets described by the quantitative waiting time indicators
inferred← citeshttps://doi.org/10.1007/springerreference_60356openalex-snapshot
Ergodic Theory: Recurrence
inferred← citeshttps://doi.org/10.1016/0020-0255(95)00227-8openalex-snapshot
Study of long-range correlations in PC binary files
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90262-eopenalex-snapshot
Probabilistic modeling of data structures on words
inferred← citeshttps://doi.org/10.1016/0898-1221(96)00135-6openalex-snapshot
Optimal data compression algorithm
inferred← citeshttps://doi.org/10.1016/j.physa.2018.11.049openalex-snapshot
Stock market daily volatility and information measures of predictability
inferred← citeshttps://doi.org/10.1016/j.physa.2020.124640openalex-snapshot
Contrasting stochasticity with chaos in a permutation Lempel–Ziv complexity — Shannon entropy plane
inferred← citeshttps://doi.org/10.1016/j.rtbm.2025.101445openalex-snapshot
Gender disparities in bike-sharing usage: Unveiling regularity and influential factors in a large-scale campus in Tianjin, China
inferred← citeshttps://doi.org/10.1016/j.spa.2023.09.009openalex-snapshot
On a waiting-time result of Kontoyiannis: Mixing or decoupling?
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.11.022openalex-snapshot
Quasi-distinct parsing and optimal compression methods
inferred← citeshttps://doi.org/10.1016/j.trc.2020.102810openalex-snapshot
Inferring temporal motifs for travel pattern analysis using large scale smart card data
inferred← citeshttps://doi.org/10.1016/j.trc.2021.103307openalex-snapshot
Minimum entropy rate-improved trip-chain method for origin–destination estimation using smart card data
inferred← citeshttps://doi.org/10.1016/s0020-0255(01)00101-3openalex-snapshot
On the average redundancy rate of the Lempel–Ziv code with the k-error protocol
inferred← citeshttps://doi.org/10.1016/s0020-0255(01)00103-7openalex-snapshot
Optimal encoding of non-stationary sources
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00167-9openalex-snapshot
Analytical depoissonization and its applications
inferred← citeshttps://doi.org/10.1016/s0377-0427(01)00510-6openalex-snapshot
The first return time test of pseudorandom numbers
inferred← citeshttps://doi.org/10.1017/cbo9780511843204openalex-snapshot
Analytic Pattern Matching
inferred← citeshttps://doi.org/10.1017/etds.2017.114openalex-snapshot
From the divergence between two measures to the shortest path between two observables
inferred← citeshttps://doi.org/10.1017/s0021900200001340openalex-snapshot
A Central Limit Theorem for Non-Overlapping Return Times
inferred← citeshttps://doi.org/10.1017/s0027763000008242openalex-snapshot
The asymptotics of string matching probabilities for Gaussian random sequences
inferred← citeshttps://doi.org/10.1017/s0143385700009706openalex-snapshot
Almost-sure waiting time results for weak and very weak Bernoulli processes
inferred← citeshttps://doi.org/10.1017/s0269964800004502openalex-snapshot
Universal Data Compression Algorithm Based on Approximate String Matching
inferred← citeshttps://doi.org/10.1017/s0960129512000783openalex-snapshot
Shannon entropy: a rigorous notion at the crossroads between probability, information theory, dynamical systems and statistical physics
inferred← citeshttps://doi.org/10.1023/a:1018683024003openalex-snapshot
Dimensions and Waiting Times for Gibbs Measures
inferred← citeshttps://doi.org/10.1023/a:1022610816550openalex-snapshot
Asymptotic Recurrence and Waiting Times for Stationary Processes
inferred← citeshttps://doi.org/10.1038/s41467-017-02480-6openalex-snapshot
Optimal compressed representation of high throughput sequence data via light assembly
inferred← citeshttps://doi.org/10.1038/s41598-025-11008-8openalex-snapshot
Leopard seal song patterns have similar predictability to nursery rhymes
inferred← citeshttps://doi.org/10.1049/iet-com.2011.0289openalex-snapshot
Entropy-based location management in long-term evolution cellular systems
inferred← citeshttps://doi.org/10.1063/5.0032515openalex-snapshot
Estimating entropy rate from censored symbolic time series: A test for time-irreversibility
inferred← citeshttps://doi.org/10.1063/5.0340243openalex-snapshot
Compression-based asymptotic decomposition: A finite-size scaling framework for entropy rate estimation and data-generating process discrimination
inferred← citeshttps://doi.org/10.1088/0951-7715/12/4/326openalex-snapshot
Repetition times for Gibbsian sources
inferred← citeshttps://doi.org/10.1088/0951-7715/14/1/311openalex-snapshot
On fluctuations and the exponential statistics of return times
inferred← citeshttps://doi.org/10.1088/0951-7715/16/3/306openalex-snapshot
A universal law of logarithm of the recurrence time
inferred← citeshttps://doi.org/10.1088/0951-7715/16/4/301openalex-snapshot
Entropy fluctuations for parabolic maps
inferred← citeshttps://doi.org/10.1088/0951-7715/16/5/318openalex-snapshot
The waiting time for irrational rotations
inferred← citeshttps://doi.org/10.1088/0951-7715/26/5/1143openalex-snapshot
The distribution of the short-return function
inferred← citeshttps://doi.org/10.1090/s0002-9939-08-09388-xopenalex-snapshot
The first return time properties of an irrational rotation
inferred← citeshttps://doi.org/10.1093/comjnl/bxn040openalex-snapshot
Near-Optimal Tracking for Residents' Comfort in Context-Aware Heterogeneous Smart Environments
inferred← citeshttps://doi.org/10.1093/ietfec/e88-a.4.1063openalex-snapshot
Source Coding Algorithms Using the Randomness of a Past Sequence
inferred← citeshttps://doi.org/10.1098/rsos.181274openalex-snapshot
Language structure is influenced by the number of speakers but seemingly not by the proportion of non-native speakers
inferred← citeshttps://doi.org/10.1103/physreve.79.046208openalex-snapshot
Entropy estimation of very short symbolic sequences
inferred← citeshttps://doi.org/10.1109/18.104321openalex-snapshot
Cutting and stacking: a method for constructing stationary processes
inferred← citeshttps://doi.org/10.1109/18.149506openalex-snapshot
A recurrence theorem for dependent processes with applications to data compression
inferred← citeshttps://doi.org/10.1109/18.179344openalex-snapshot
Entropy and data compression schemes
inferred← citeshttps://doi.org/10.1109/18.212306openalex-snapshot
Exact analysis of the Lempel-Ziv algorithm for i.i.d. sources
inferred← citeshttps://doi.org/10.1109/18.256495openalex-snapshot
An algorithm for source coding subject to a fidelity criterion, based on string matching
inferred← citeshttps://doi.org/10.1109/18.259648openalex-snapshot
Asymptotic properties of data compression and suffix trees
inferred← citeshttps://doi.org/10.1109/18.265504openalex-snapshot
On the minimum description length principle for sources with piecewise constant parameters
inferred← citeshttps://doi.org/10.1109/18.335958openalex-snapshot
Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures
inferred← citeshttps://doi.org/10.1109/18.370149openalex-snapshot
Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
inferred← citeshttps://doi.org/10.1109/18.382018openalex-snapshot
Improved redundancy of a version of the Lempel-Ziv algorithm
inferred← citeshttps://doi.org/10.1109/18.485707openalex-snapshot
Classification with finite memory
inferred← citeshttps://doi.org/10.1109/18.490546openalex-snapshot
An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
inferred← citeshttps://doi.org/10.1109/18.532879openalex-snapshot
Match-length functions for data compression
inferred← citeshttps://doi.org/10.1109/18.556107openalex-snapshot
Weakly convergent nonparametric forecasting of stationary time series
inferred← citeshttps://doi.org/10.1109/18.623143openalex-snapshot
A suboptimal lossy data compression based on approximate pattern matching
inferred← citeshttps://doi.org/10.1109/18.623144openalex-snapshot
The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
inferred← citeshttps://doi.org/10.1109/18.641559openalex-snapshot
On fixed-database universal data compression with limited memory
inferred← citeshttps://doi.org/10.1109/18.650987openalex-snapshot
On the performance of data compression algorithms based upon string matching
inferred← citeshttps://doi.org/10.1109/18.650988openalex-snapshot
On sliding-window universal data compression with limited memory
inferred← citeshttps://doi.org/10.1109/18.661523openalex-snapshot
The context-tree weighting method: extensions
inferred← citeshttps://doi.org/10.1109/18.669425openalex-snapshot
Nonparametric entropy estimation for stationary processes and random fields, with applications to English text
inferred← citeshttps://doi.org/10.1109/18.720530openalex-snapshot
On the role of pattern matching in information theory
inferred← citeshttps://doi.org/10.1109/18.720531openalex-snapshot
Fifty years of Shannon theory
inferred← citeshttps://doi.org/10.1109/18.720532openalex-snapshot
The interactions between ergodic theory and information theory
inferred← citeshttps://doi.org/10.1109/18.761258openalex-snapshot
Universal schemes for learning the best nonlinear predictor given the infinite past and side information
inferred← citeshttps://doi.org/10.1109/18.782108openalex-snapshot
The shortest common superstring problem: average case analysis for both exact and approximate matching
inferred← citeshttps://doi.org/10.1109/18.796370openalex-snapshot
An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
inferred← citeshttps://doi.org/10.1109/18.79942openalex-snapshot
New asymptotic bounds and improvements on the Lempel-Ziv data compression algorithm
inferred← citeshttps://doi.org/10.1109/18.79955openalex-snapshot
Fixed data base version of the Lempel-Ziv data compression algorithm
inferred← citeshttps://doi.org/10.1109/18.904515openalex-snapshot
Natural type selection in adaptive lossy compression
inferred← citeshttps://doi.org/10.1109/18.904532openalex-snapshot
The first-order asymptotic of waiting times with distortion between stationary processes
inferred← citeshttps://doi.org/10.1109/18.945259openalex-snapshot
Entropy estimators and serial tests for ergodic chains
inferred← citeshttps://doi.org/10.1109/26.481234openalex-snapshot
Block permutation coding of images using cosine transform
inferred← citeshttps://doi.org/10.1109/34.777372openalex-snapshot
Pattern matching image compression: algorithmic and empirical results
inferred← citeshttps://doi.org/10.1109/5.286191openalex-snapshot
The sliding-window Lempel-Ziv algorithm is asymptotically optimal
inferred← citeshttps://doi.org/10.1109/9780470544907.ch2openalex-snapshot
Fifty Years of Shannon Theory
inferred← citeshttps://doi.org/10.1109/acssc.1997.679123openalex-snapshot
Second-order analysis of lossless and lossy versions of Lempel-Ziv codes
inferred← citeshttps://doi.org/10.1109/carpathiancc.2014.6843626openalex-snapshot
How to predict location and for what to use it?
inferred← citeshttps://doi.org/10.1109/ciss.2011.5766226openalex-snapshot
Suffix trees for universal source modeling with applications
inferred← citeshttps://doi.org/10.1109/cne.2003.1196753openalex-snapshot
Estimation of muscle spindle information rate by pattern matching and effects of the fusimotor system
inferred← citeshttps://doi.org/10.1109/dcc.1991.213356openalex-snapshot
A typical behavior of some data compression schemes
inferred← citeshttps://doi.org/10.1109/dcc.1991.213361openalex-snapshot
Fixed data base version of the Lempel-Ziv data compression algorithm
inferred← citeshttps://doi.org/10.1109/dcc.1993.253135openalex-snapshot
On approximate string matching
inferred← citeshttps://doi.org/10.1109/dcc.1995.515516openalex-snapshot
Generalized Lempel-Ziv parsing scheme and its preliminary analysis of the average profile
inferred← citeshttps://doi.org/10.1109/dcc.1996.488349openalex-snapshot
Pattern matching image compression
inferred← citeshttps://doi.org/10.1109/dcc.1996.488376openalex-snapshot
Stationary entrophy estimation via string matching
inferred← citeshttps://doi.org/10.1109/dcc.1998.672158openalex-snapshot
Context tables: a tool for describing text compression algorithms
inferred← citeshttps://doi.org/10.1109/dcc.1998.672221openalex-snapshot
Optimal lossless compression of a class of dynamic sources
inferred← citeshttps://doi.org/10.1109/dcc.2000.838177openalex-snapshot
On the average redundancy rate of the Lempel-Ziv code with k-error protocol
inferred← citeshttps://doi.org/10.1109/dcc.2001.917171openalex-snapshot
Overlap in adaptive vector quantization
inferred← citeshttps://doi.org/10.1109/dcc.2003.1194018openalex-snapshot
Joint source-channel LZ'77 coding
inferred← citeshttps://doi.org/10.1109/icbme.2011.6168541openalex-snapshot
Lempel-Ziv Complexity criteria for nonlinear analysis of gait in patients with Parkinson's disease
inferred← citeshttps://doi.org/10.1109/icics.2009.5397536openalex-snapshot
A note on the estimation of string complexity for short strings
inferred← citeshttps://doi.org/10.1109/icip.1996.560828openalex-snapshot
A pattern matching approach to image compression
inferred← citeshttps://doi.org/10.1109/isit.1991.695163openalex-snapshot
Fixed Data Base Version Of The Lempel-Ziv Data Compression Algorithm
inferred← citeshttps://doi.org/10.1109/isit.1993.748503openalex-snapshot
Entropy and the Consistent Estimation of Joint Distributions
inferred← citeshttps://doi.org/10.1109/isit.1994.394792openalex-snapshot
Almost sure waiting time results for weak and very weak Bernoulli processes
inferred← citeshttps://doi.org/10.1109/isit.1994.394793openalex-snapshot
Entropy and recurrence rates for stationary random fields
inferred← citeshttps://doi.org/10.1109/isit.1994.394960openalex-snapshot
Another look at universal data compression
inferred← citeshttps://doi.org/10.1109/isit.1994.394963openalex-snapshot
The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
inferred← citeshttps://doi.org/10.1109/isit.1994.394969openalex-snapshot
Typical sequences and all that: entropy, pattern matching, and data compression
inferred← citeshttps://doi.org/10.1109/isit.1994.395004openalex-snapshot
Asymptotic properties of algorithms of data compression with fidelity criterion based on string matching
inferred← citeshttps://doi.org/10.1109/isit.1995.531182openalex-snapshot
A lossy data compression based on an approximate pattern matching
inferred← citeshttps://doi.org/10.1109/isit.1997.613236openalex-snapshot
On the distribution of recurrence times and the exact asymptotics of Lempel-Ziv coding
inferred← citeshttps://doi.org/10.1109/isit.1997.613241openalex-snapshot
Recurrence times and pointwise lower bounds in data compression
inferred← citeshttps://doi.org/10.1109/isit.1998.708828openalex-snapshot
Approximate-match waiting times: substitution/deletion metric
inferred← citeshttps://doi.org/10.1109/isit.1998.709019openalex-snapshot
The asymptotics of string matching probabilities for Gaussian random sequences
inferred← citeshttps://doi.org/10.1109/isit.2004.1365096openalex-snapshot
On certain pathwise properties of the sliding-window lempel ziv algorithm
inferred← citeshttps://doi.org/10.1109/isit.2009.5205727openalex-snapshot
Length of minimal forbidden words on a stationary ergodic source
inferred← citeshttps://doi.org/10.1109/isit.2012.6284245openalex-snapshot
Universal estimation of directed information via sequential probability assignments
inferred← citeshttps://doi.org/10.1109/isit.2013.6620753openalex-snapshot
On match lengths and the asymptotic behavior of Sliding Window Lempel-Ziv algorithm for zero entropy sequences
inferred← citeshttps://doi.org/10.1109/isit.2014.6875002openalex-snapshot
Large deviation property of waiting times for Markov and mixing processes
inferred← citeshttps://doi.org/10.1109/isit.2016.7541386openalex-snapshot
Estimation of entropy rate and Rényi entropy rate for Markov chains
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174261openalex-snapshot
Complexity of Estimating Rényi Entropy of Markov Chains
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206685openalex-snapshot
Entropy Rate Estimation for Markov Chains with Continuous Distributions
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619304openalex-snapshot
Ziv-Merhav Estimation for Hidden-Markov Processes
inferred← citeshttps://doi.org/10.1109/isita.2008.4895573openalex-snapshot
On the optimality of Sliding Window Lempel-Ziv algorithm with side information
inferred← citeshttps://doi.org/10.1109/itw.1998.706381openalex-snapshot
Universal compression with restricted training data and constrained latency
inferred← citeshttps://doi.org/10.1109/itw.2005.1531876openalex-snapshot
Ergodic theorems for algorithmically random sequences
inferred← citeshttps://doi.org/10.1109/itw.2007.4313150openalex-snapshot
Entropy Estimators with Almost Sure Convergence and an O(n-1) Variance
inferred← citeshttps://doi.org/10.1109/itw.2015.7133104openalex-snapshot
Exponential rates of convergence for waiting times and generalized AEP
inferred← citeshttps://doi.org/10.1109/itw55543.2023.10160233openalex-snapshot
Rate-Distortion in Non-Convex Families
inferred← citeshttps://doi.org/10.1109/itw55543.2023.10161645openalex-snapshot
Truly Bayesian Entropy Estimation
inferred← citeshttps://doi.org/10.1109/itwksps.2010.5503137openalex-snapshot
Almost sure optimality of sliding window Lempel-Ziv algorithm and variants
inferred← citeshttps://doi.org/10.1109/ncc.2013.6487918openalex-snapshot
Sequential change detection using estimators of entropy & divergence rate
inferred← citeshttps://doi.org/10.1109/percom.2003.1192773openalex-snapshot
Location aware resource management in smart homes
inferred← citeshttps://doi.org/10.1109/tbme.2006.883696openalex-snapshot
Interpretation of the Lempel-Ziv Complexity Measure in the Context of Biomedical Signal Analysis
inferred← citeshttps://doi.org/10.1109/tifs.2019.2947871openalex-snapshot
On the Analysis and Improvement of Min-Entropy Estimation on Time-Varying Data
inferred← citeshttps://doi.org/10.1109/tit.2002.1003819openalex-snapshot
Shannon theory: perspective, trends, and applications special issue dedicated to aaron d. wyner
inferred← citeshttps://doi.org/10.1109/tit.2002.1003834openalex-snapshot
A universal predictor based on pattern matching
inferred← citeshttps://doi.org/10.1109/tit.2002.1003838openalex-snapshot
Hidden Markov processes
inferred← citeshttps://doi.org/10.1109/tit.2002.1003841openalex-snapshot
Source coding, large deviations, and approximate pattern matching
inferred← citeshttps://doi.org/10.1109/tit.2002.1003848openalex-snapshot
Entropy and recurrence rates for stationary random fields
inferred← citeshttps://doi.org/10.1109/tit.2002.801477openalex-snapshot
On the performance of recency-rank and block-sorting universal lossless data compression algorithms
inferred← citeshttps://doi.org/10.1109/tit.2004.830771openalex-snapshot
Universal Entropy Estimation Via Block Sorting
inferred← citeshttps://doi.org/10.1109/tit.2006.885458openalex-snapshot
On Certain Pathwise Properties of the Sliding-Window Lempel–Ziv Algorithm
inferred← citeshttps://doi.org/10.1109/tit.2013.2259291openalex-snapshot
Almost Sure Optimality of Sliding Window Lempel–Ziv Algorithm and Variants Revisited
inferred← citeshttps://doi.org/10.1109/tit.2013.2267934openalex-snapshot
Universal Estimation of Directed Information
inferred← citeshttps://doi.org/10.1109/tit.2014.2368986openalex-snapshot
On Match Lengths, Zero Entropy, and Large Deviations—With Application to Sliding Window Lempel–Ziv Algorithm
inferred← citeshttps://doi.org/10.1109/tit.2015.2406695openalex-snapshot
Rényi Entropies and Large Deviations for the First Match Function
inferred← citeshttps://doi.org/10.1109/tit.2015.2412945openalex-snapshot
Minimax Estimation of Functionals of Discrete Distributions
inferred← citeshttps://doi.org/10.1109/tit.2017.2733535openalex-snapshot
Maximal Repetition and Zero Entropy Rate
inferred← citeshttps://doi.org/10.1109/tit.2017.2757494openalex-snapshot
The Shortest Possible Return Time of $\beta$ -Mixing Processes
inferred← citeshttps://doi.org/10.1109/tkde.2005.3openalex-snapshot
Constructing suffix tree for gigabyte sequences with megabyte memory
inferred← citeshttps://doi.org/10.1109/tmc.2007.1058openalex-snapshot
A Predictive Framework for Location-Aware Resource Management in Smart Homes
inferred← citeshttps://doi.org/10.1109/tnnls.2019.2890970openalex-snapshot
Natural Language Statistical Features of LSTM-Generated Texts
inferred← citeshttps://doi.org/10.1109/wifs.2010.5711459openalex-snapshot
A universal divergence-rate estimator for steganalysis in timing channels
inferred← citeshttps://doi.org/10.1109/wits.1994.513855openalex-snapshot
Bounds on universal coding: the next generation
inferred← citeshttps://doi.org/10.1121/1.2161827openalex-snapshot
Information entropy of humpback whale songs
inferred← citeshttps://doi.org/10.1121/1.2967863openalex-snapshot
Information theory analysis of Australian humpback whale song
inferred← citeshttps://doi.org/10.1137/0222070openalex-snapshot
A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
inferred← citeshttps://doi.org/10.1137/110824772openalex-snapshot
Metric Entropy and the Optimal Prediction of Chaotic Signals
inferred← citeshttps://doi.org/10.1137/s0097539796301811openalex-snapshot
Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm
inferred← citeshttps://doi.org/10.1142/s0218127410026794openalex-snapshot
RECURRENCE PLOTS FOR SYMBOLIC SEQUENCES
inferred← citeshttps://doi.org/10.1145/3637528.3671995openalex-snapshot
Quantifying and Estimating the Predictability Upper Bound of Univariate Numeric Time Series
inferred← citeshttps://doi.org/10.11606/t.104.2022.tde-24052022-160500openalex-snapshot
Poincaré recurrence times in stochastic mixing processes
inferred← citeshttps://doi.org/10.11606/t.45.2015.tde-16072015-154752openalex-snapshot
Teoremas fundamentais para o caminho mais curto entre duas sequências
inferred← citeshttps://doi.org/10.1162/biot.2006.1.3.302openalex-snapshot
Approaches to Information-Theoretic Analysis of Neural Activity
inferred← citeshttps://doi.org/10.1214/23-ba1362openalex-snapshot
Posterior Representations for Bayesian Context Trees: Sampling, Estimation and Convergence
inferred← citeshttps://doi.org/10.1214/25-ecp718openalex-snapshot
Repetition and recurrence times: Dual statements and summable mixing rates
inferred← citeshttps://doi.org/10.1214/aoap/1029962749openalex-snapshot
The asymptotics of waiting times between stationary processes, allowing distortion
inferred← citeshttps://doi.org/10.1214/aoap/1029962813openalex-snapshot
More on recurrence and waiting times
showing the first 200 of 245 · page through all 245
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.