On the public citation graph
Universal redundancy rates do not exist
0 signed · 52 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1090/memo/0262openalex-snapshot
Equivalence of measure preserving transformations
inferredcites →https://doi.org/10.1109/18.108250openalex-snapshot
Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
inferredcites →https://doi.org/10.1109/tit.1977.1055714openalex-snapshot
A universal algorithm for sequential data compression
inferredcites →https://doi.org/10.1214/aop/1176990840openalex-snapshot
Universal Almost Sure Data Compression
inferredcites →https://doi.org/10.1214/aos/1176350051openalex-snapshot
Stochastic Complexity and Modeling
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jmva.1999.1825openalex-snapshot
Strongly Consistent Nonparametric Forecasting and Regression for Stationary Ergodic Sequences
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_29openalex-snapshot
Generalized Shannon Code Minimizes the Maximal Redundancy
inferred← citeshttps://doi.org/10.1007/978-1-4612-2618-5_35openalex-snapshot
Lower Bounds on Expected Redundancy for Classes of Continuous Markov Sources
inferred← citeshttps://doi.org/10.1007/978-3-0348-8211-8_19openalex-snapshot
A Combinatorial Problem Arising in Information Theory: Precise Minimax Redundancy for Markov Sources
inferred← citeshttps://doi.org/10.1007/978-3-319-96262-7_2openalex-snapshot
Universal Coding on Finite Alphabets
inferred← citeshttps://doi.org/10.1007/bf02783038openalex-snapshot
Minimal rates of entropy convergence for completely ergodic systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00298-wopenalex-snapshot
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
inferred← citeshttps://doi.org/10.1016/j.spl.2012.07.007openalex-snapshot
On bounded redundancy of universal codes
inferred← citeshttps://doi.org/10.1063/1.3630929openalex-snapshot
Excess entropy in natural language: Present state and perspectives
inferred← citeshttps://doi.org/10.1088/0305-4470/35/7/308openalex-snapshot
Scaling behaviour of entropy estimates
inferred← citeshttps://doi.org/10.1109/18.335876openalex-snapshot
The strong law of large numbers for sequential decisions under uncertainty
inferred← citeshttps://doi.org/10.1109/18.370156openalex-snapshot
Universal redundancy rates for the class of B-processes do not exist
inferred← citeshttps://doi.org/10.1109/18.382013openalex-snapshot
Fixed-rate universal lossy source coding and rates of convergence for memoryless sources
inferred← citeshttps://doi.org/10.1109/18.556107openalex-snapshot
Weakly convergent nonparametric forecasting of stationary time series
inferred← citeshttps://doi.org/10.1109/18.556596openalex-snapshot
Redundancy rates for renewal and other processes
inferred← citeshttps://doi.org/10.1109/18.567640openalex-snapshot
Average redundancy rate of the Lempel-Ziv code
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.782149openalex-snapshot
The asymptotic redundancy of Bayes rules for Markov chains
inferred← citeshttps://doi.org/10.1109/18.995542openalex-snapshot
Universal lossless source coding with the Burrows Wheeler transform
inferred← citeshttps://doi.org/10.1109/dcc.1999.755667openalex-snapshot
Universal lossless source coding with the Burrows Wheeler transform
inferred← citeshttps://doi.org/10.1109/isit.1994.394791openalex-snapshot
Universal redundancy rates for B-processes do not exist
inferred← citeshttps://doi.org/10.1109/isit.2000.866668openalex-snapshot
Asymptotic average redundancy of Huffman (and Shannon-Fano) block codes
inferred← citeshttps://doi.org/10.1109/isit.2000.866797openalex-snapshot
Analytic variations on the redundancy rate of renewal processes
inferred← citeshttps://doi.org/10.1109/isit.2007.4557209openalex-snapshot
On vocabulary size of grammar-based codes
inferred← citeshttps://doi.org/10.1109/tit.2002.804115openalex-snapshot
Analytic variations on redundancy rates of renewal processes
inferred← citeshttps://doi.org/10.1109/tit.2004.830765openalex-snapshot
Markov Types and Minimax Redundancy for Markov Sources
inferred← citeshttps://doi.org/10.1109/tit.2004.836702openalex-snapshot
Precise Minimax Redundancy and Regret
inferred← citeshttps://doi.org/10.1109/tit.2006.885484openalex-snapshot
Redundancy of the Context-Tree Weighting Method on Renewal and Markov Renewal Processes
inferred← citeshttps://doi.org/10.1109/tit.2008.2008150openalex-snapshot
Coding on Countably Infinite Alphabets
inferred← citeshttps://doi.org/10.1109/tit.2010.2103831openalex-snapshot
Universal Coding on Infinite Alphabets: Exponentially Decreasing Envelopes
inferred← citeshttps://doi.org/10.1109/tit.2011.2145170openalex-snapshot
On the Vocabulary of Grammar-Based Codes and the Logical Consistency of Texts
inferred← citeshttps://doi.org/10.1109/tit.2012.2191476openalex-snapshot
Counting Markov Types, Balanced Matrices, and Eulerian Graphs
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.2016.2573834openalex-snapshot
Types of Markov Fields and Tilings
inferred← citeshttps://doi.org/10.1109/tit.2017.2734655openalex-snapshot
Regular Hilberg Processes: An Example of Processes With a Vanishing Entropy Rate
inferred← citeshttps://doi.org/10.1109/wits.1994.513858openalex-snapshot
When is the weak rate equal to the strong rate?
inferred← citeshttps://doi.org/10.1561/0100000090openalex-snapshot
Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
inferred← citeshttps://doi.org/10.3390/e11040634openalex-snapshot
A Lower-Bound for the Maximin Redundancy in Pattern Coding
inferred← citeshttps://doi.org/10.3390/e21040432openalex-snapshot
Examining the Limits of Predictability of Human Mobility
inferred← citeshttps://doi.org/10.4467/20838476si.14.003.3020openalex-snapshot
Hilberg’s Conjecture : a Challenge for Machine Learning
inferred← citeshttps://doi.org/10.46298/dmtcs.3555openalex-snapshot
Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding
inferred← citeshttps://doi.org/10.48550/arxiv.0901.2321openalex-snapshot
The Redundancy of a Computable Code on a Noncomputable Distribution
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.