On the public citation graph
Redundancy rates for renewal and other processes
0 signed · 47 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.1109/18.212281openalex-snapshot
Universal redundancy rates do not exist
inferredcites →https://doi.org/10.1109/18.370156openalex-snapshot
Universal redundancy rates for the class of B-processes do not exist
inferredcites →https://doi.org/10.1109/isit.1994.394791openalex-snapshot
Universal redundancy rates for B-processes do not exist
inferredcites →https://doi.org/10.1109/itw.1998.706380openalex-snapshot
Fuzzy estimation of unknown source model for universal coding
inferredcites →https://doi.org/10.1109/tit.1981.1056331openalex-snapshot
The performance of universal encoding
inferredcites →https://doi.org/10.1112/plms/s2-17.1.75openalex-snapshot
Asymptotic Formulaae in Combinatory Analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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.1109/18.720546openalex-snapshot
The method of types [information theory]
inferred← citeshttps://doi.org/10.1109/allerton.2015.7447108openalex-snapshot
Single letter characterization of average-case strong redundancy of compressing memoryless sequences
inferred← citeshttps://doi.org/10.1109/icassp.2012.6288236openalex-snapshot
A game theoretic approach to source identification with known statistics
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/isit50566.2022.9834809openalex-snapshot
Precise Minimax Regret for Logistic Regression
inferred← citeshttps://doi.org/10.1109/itw.2004.1405283openalex-snapshot
Grammar-based coding: new perspectives
inferred← citeshttps://doi.org/10.1109/jsait.2023.3243989openalex-snapshot
Tail Redundancy and its Characterization of Compression of Memoryless Sources
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238192openalex-snapshot
Always Good Turing: asymptotically optimal probability estimation
inferred← citeshttps://doi.org/10.1109/tifs.2012.2237397openalex-snapshot
The Source Identification Game: An Information-Theoretic Perspective
inferred← citeshttps://doi.org/10.1109/tit.2002.1003850openalex-snapshot
Order estimation for a special class of hidden Markov sources and binary renewal processes
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.2003.818411openalex-snapshot
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
inferred← citeshttps://doi.org/10.1109/tit.2004.830747openalex-snapshot
Problems on Sequences: Information Theory and Computer Science Interface
inferred← citeshttps://doi.org/10.1109/tit.2004.830761openalex-snapshot
Universal Compression of Memoryless Sources Over Unknown Alphabets
inferred← citeshttps://doi.org/10.1109/tit.2004.830781openalex-snapshot
Performance Analysis of Grammar-Based Codes Revisited
inferred← citeshttps://doi.org/10.1109/tit.2004.836702openalex-snapshot
Precise Minimax Redundancy and Regret
inferred← citeshttps://doi.org/10.1109/tit.2006.880013openalex-snapshot
Universal Compression of Markov and Related Sources Over Arbitrary Alphabets
inferred← citeshttps://doi.org/10.1109/tit.2006.881742openalex-snapshot
Consistency of the Unlimited BIC Context Tree Estimator
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.2013.2288914openalex-snapshot
About Adaptive Coding on Countable Alphabets
inferred← citeshttps://doi.org/10.1109/tit.2014.2325571openalex-snapshot
Binary Hypothesis Testing Game With Training Data
inferred← citeshttps://doi.org/10.1109/tit.2015.2462846openalex-snapshot
Unequal Message Protection: Asymptotic and Non-Asymptotic Tradeoffs
inferred← citeshttps://doi.org/10.1109/tit.2023.3279197openalex-snapshot
Regret Bounds for Log-Loss via Bayesian Algorithms
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.1126/science.1088284openalex-snapshot
Always Good Turing: Asymptotically Optimal Probability Estimation
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.46298/dmtcs.3555openalex-snapshot
Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding
inferred← citeshttps://doi.org/10.48550/arxiv.1103.2058openalex-snapshot
Perfect simulation for locally continuous chains of infinite order
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.