On the public citation graph
A strong version of the redundancy-capacity theorem of universal coding
0 signed · 117 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.1007/978-3-319-21852-6_3openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1016/0378-3758(94)90153-8openalex-snapshot
Jeffreys' prior is asymptotically least favorable under entropy risk
inferredcites →https://doi.org/10.1016/b978-1-55860-213-7.50010-9openalex-snapshot
Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension
inferredcites →https://doi.org/10.1109/18.265504openalex-snapshot
On the minimum description length principle for sources with piecewise constant parameters
inferredcites →https://doi.org/10.1109/18.312161openalex-snapshot
Optimal sequential probability assignment for individual sequences
inferredcites →https://doi.org/10.1109/18.481776openalex-snapshot
Fisher information and stochastic complexity
inferredcites →https://doi.org/10.1109/isit.1995.531118openalex-snapshot
Universal coding for arbitrarily varying sources
inferredcites →https://doi.org/10.1109/tit.1980.1056167openalex-snapshot
A source matching approach to finding minimax codes
inferredcites →https://doi.org/10.1109/tit.1981.1056355openalex-snapshot
Efficient universal noiseless source codes
inferredcites →https://doi.org/10.1109/tit.1981.1056427openalex-snapshot
On total boundedness for existence of weakly minimax universal codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1983.1056652openalex-snapshot
Minimax noiseless universal coding for Markov sources
inferredcites →https://doi.org/10.1109/tit.1983.1056704openalex-snapshot
Robust noiseless source coding through a game theoretical approach
inferredcites →https://doi.org/10.1109/tit.1984.1056936openalex-snapshot
Universal coding, information, prediction, and estimation
inferredcites →https://doi.org/10.1109/tit.1986.1057210openalex-snapshot
Complexity of strings in the class of Markov sources
inferredcites →https://doi.org/10.1109/tit.1987.1057366openalex-snapshot
Minimax universal noiseless coding for unifilar and Markov sources (Corresp.)
inferredcites →https://doi.org/10.1111/j.2517-6161.1979.tb01066.xopenalex-snapshot
Reference Posterior Distributions for Bayesian Inference
inferredcites →https://doi.org/10.1137/1116025openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1214/aop/1176996454openalex-snapshot
$I$-Divergence Geometry of Probability Distributions and Minimization Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44581-1_21openalex-snapshot
Strong Entropy Concentration, Game Theory, and Algorithmic Randomness
inferred← citeshttps://doi.org/10.1016/j.artint.2025.104400openalex-snapshot
On preference learning based on sequential Bayesian optimization with pairwise comparison
inferred← citeshttps://doi.org/10.1037/a0030638openalex-snapshot
Information utility: Quantifying the total psychometric information provided by a measure.
inferred← citeshttps://doi.org/10.1093/comjnl/42.4.260openalex-snapshot
Hypothesis Selection and Testing by the MDL Principle
inferred← citeshttps://doi.org/10.1103/physrevlett.75.3772openalex-snapshot
Bounds for Predictive Errors in the Statistical Mechanics of Supervised Learning
inferred← citeshttps://doi.org/10.1109/18.481776openalex-snapshot
Fisher information and stochastic complexity
inferred← citeshttps://doi.org/10.1109/18.481802openalex-snapshot
Lower bounds on expected redundancy for nonparametric classes
inferred← citeshttps://doi.org/10.1109/18.605594openalex-snapshot
A general minimax result for relative entropy
inferred← citeshttps://doi.org/10.1109/18.720554openalex-snapshot
The minimum description length principle in coding and modeling
inferred← citeshttps://doi.org/10.1109/18.771150openalex-snapshot
Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
inferred← citeshttps://doi.org/10.1109/18.817520openalex-snapshot
Coding of sources with two-sided geometric distributions and unknown parameters
inferred← citeshttps://doi.org/10.1109/18.825807openalex-snapshot
Minimum description length induction, Bayesianism, and Kolmogorov complexity
inferred← citeshttps://doi.org/10.1109/18.887857openalex-snapshot
Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources .I. The regular case
inferred← citeshttps://doi.org/10.1109/18.930912openalex-snapshot
Strong optimality of the normalized ML models as universal codes and information in data
inferred← citeshttps://doi.org/10.1109/18.945240openalex-snapshot
Universal prediction of individual binary sequences in the presence of noise
inferred← citeshttps://doi.org/10.1109/9780470544907.ch2openalex-snapshot
Fifty Years of Shannon Theory
inferred← citeshttps://doi.org/10.1109/access.2020.2994319openalex-snapshot
Network Traffic Compression With Side Information
inferred← citeshttps://doi.org/10.1109/allerton.2012.6483475openalex-snapshot
Network Compression: Memory-assisted universal coding of sources with correlated parameters
inferred← citeshttps://doi.org/10.1109/allerton.2013.6736619openalex-snapshot
Results on the optimal memory-assisted universal compression performance for mixture sources
inferred← citeshttps://doi.org/10.1109/allerton.2014.7028438openalex-snapshot
A novel correlation model for universal compression of parametric sources
inferred← citeshttps://doi.org/10.1109/dcc.2001.917168openalex-snapshot
Universal lossless compression of piecewise stationary slowly varying sources
inferred← citeshttps://doi.org/10.1109/icc.2003.1204571openalex-snapshot
On strongly sequential compression of sources with abrupt changes in statistics
inferred← citeshttps://doi.org/10.1109/icip.1996.560829openalex-snapshot
Modeling and low-complexity adaptive coding for image prediction residuals
inferred← citeshttps://doi.org/10.1109/isit.1995.531118openalex-snapshot
Universal coding for arbitrarily varying sources
inferred← citeshttps://doi.org/10.1109/isit.1995.535748openalex-snapshot
Optimal universal learning and prediction of probabilistic concepts
inferred← citeshttps://doi.org/10.1109/isit.2000.866624openalex-snapshot
On the redundancy of universal lossless coding for general piecewise stationary sources
inferred← citeshttps://doi.org/10.1109/isit.2004.1365062openalex-snapshot
Average case universal lossless compression with unknown alphabets
inferred← citeshttps://doi.org/10.1109/isit.2007.4557507openalex-snapshot
Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions
inferred← citeshttps://doi.org/10.1109/isit.2011.6034225openalex-snapshot
Mutual information, relative entropy, and estimation in the Poisson channel
inferred← citeshttps://doi.org/10.1109/isit.2012.6283020openalex-snapshot
Results on the fundamental gain of memory-assisted universal source coding
inferred← citeshttps://doi.org/10.1109/isit.2012.6283493openalex-snapshot
On optimum strategies for minimizing the exponential moments of a loss function
inferred← citeshttps://doi.org/10.1109/isit.2012.6284253openalex-snapshot
On lossless universal compression of distributed identical sources
inferred← citeshttps://doi.org/10.1109/isit.2013.6620265openalex-snapshot
Minimax filtering regret via relations between information and estimation
inferred← citeshttps://doi.org/10.1109/isit.2014.6875228openalex-snapshot
Mismatched side information in wireless network compression via overhearing helpers
inferred← citeshttps://doi.org/10.1109/isit.2018.8437764openalex-snapshot
Minimax Redundancy for Markov Chains with Large State Space
inferred← citeshttps://doi.org/10.1109/isit.2019.8849635openalex-snapshot
Tail redundancy and its characterizations of universal compression
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834743openalex-snapshot
On Information-Theoretic Determination of Misspecified Rates of Convergence
inferred← citeshttps://doi.org/10.1109/ita.2007.4357578openalex-snapshot
On Universal Coding of Unordered Data
inferred← citeshttps://doi.org/10.1109/ita.2007.4357603openalex-snapshot
Universal Noiseless Compression for Noisy Data
inferred← citeshttps://doi.org/10.1109/itw.2002.1115425openalex-snapshot
Game theory, maximum generalized entropy, minimum discrepancy, robust Bayes and Pythagoras
inferred← citeshttps://doi.org/10.1109/itw.2013.6691289openalex-snapshot
On Semi-Probabilistic universal prediction
inferred← citeshttps://doi.org/10.1109/itw.2014.6970823openalex-snapshot
Fundamental limits of universal lossless one-to-one compression of parametric sources
inferred← citeshttps://doi.org/10.1109/itw.2018.8613335openalex-snapshot
Redundancy Capacity Theorem for On-Line Learning Under a Certain Form of Hypotheses Class
inferred← citeshttps://doi.org/10.1109/itw54588.2022.9965823openalex-snapshot
Bayesian Change-Point Detection via Context-Tree Weighting
inferred← citeshttps://doi.org/10.1109/itwksps.2010.5503172openalex-snapshot
The relationship between causal and non-causal mismatched estimation in continuous-time AWGN channels
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/jstsp.2018.2848230openalex-snapshot
Bayesian Nonparametric Causal Inference: Information Rates and Learning Algorithms
inferred← citeshttps://doi.org/10.1109/mlsp.2015.7324319openalex-snapshot
A rate-distortion framework for supervised learning
inferred← citeshttps://doi.org/10.1109/spawc.2014.6941726openalex-snapshot
On optimality of data clustering for packet-level memory-assisted compression of network traffic
inferred← citeshttps://doi.org/10.1109/tit.2002.1003844openalex-snapshot
The Gaussian watermarking game
inferred← citeshttps://doi.org/10.1109/tit.2002.1003851openalex-snapshot
Universal codes for finite sequences of integers drawn from a monotone distribution
inferred← citeshttps://doi.org/10.1109/tit.2002.806134openalex-snapshot
Scanning and prediction in multidimensional data arrays
inferred← citeshttps://doi.org/10.1109/tit.2003.817449openalex-snapshot
Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels
inferred← citeshttps://doi.org/10.1109/tit.2004.831759openalex-snapshot
Universal Lossless Coding for Sources With Repeating Statistics
inferred← citeshttps://doi.org/10.1109/tit.2004.836702openalex-snapshot
Precise Minimax Redundancy and Regret
inferred← citeshttps://doi.org/10.1109/tit.2004.836922openalex-snapshot
Exact Minimax Strategies for Predictive Density Estimation, Data Compression, and Model Selection
inferred← citeshttps://doi.org/10.1109/tit.2006.872846openalex-snapshot
On the MDL principle for i.i.d. sources with large alphabets
inferred← citeshttps://doi.org/10.1109/tit.2006.883609openalex-snapshot
Universal Lossless Compression With Unknown Alphabets—The Average Case
inferred← citeshttps://doi.org/10.1109/tit.2006.887466openalex-snapshot
Guessing Under Source Uncertainty
inferred← citeshttps://doi.org/10.1109/tit.2010.2054430openalex-snapshot
The Relationship Between Causal and Noncausal Mismatched Estimation in Continuous-Time AWGN Channels
inferred← citeshttps://doi.org/10.1109/tit.2011.2172572openalex-snapshot
Mutual Information, Relative Entropy, and Estimation in the Poisson Channel
inferred← citeshttps://doi.org/10.1109/tit.2013.2281695openalex-snapshot
Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions
inferred← citeshttps://doi.org/10.1109/tit.2014.2323069openalex-snapshot
Minimax Filtering Regret via Relations Between Information and Estimation
inferred← citeshttps://doi.org/10.1109/tit.2017.2775612openalex-snapshot
Minimum Rates of Approximate Sufficient Statistics
inferred← citeshttps://doi.org/10.1109/tit.2019.2898659openalex-snapshot
Fine Asymptotics for Universal One-to-One Compression of Parametric Sources
inferred← citeshttps://doi.org/10.1109/tit.2019.2941895openalex-snapshot
Universal Weak Variable-Length Source Coding on Countably Infinite Alphabets
inferred← citeshttps://doi.org/10.1109/tit.2021.3134891openalex-snapshot
On Universal D-Semifaithful Coding for Memoryless Sources With Infinite Alphabets
inferred← citeshttps://doi.org/10.1109/tit.2023.3253133openalex-snapshot
D -Semifaithful Codes That are Universal Over Both Memoryless Sources and Distortion Measures
inferred← citeshttps://doi.org/10.1109/tit.2023.3314048openalex-snapshot
Universal Graph Compression: Stochastic Block Models
inferred← citeshttps://doi.org/10.1109/tit.2025.3633236openalex-snapshot
Universal Discrete Filtering With Lookahead or Delay
inferred← citeshttps://doi.org/10.1109/tnet.2015.2418296openalex-snapshot
Packet-Level Network Compression: Realization and Scaling of the Network-Wide Benefits
inferred← citeshttps://doi.org/10.1109/tsp.2015.2458784openalex-snapshot
Generalized Context Modeling With Multi-Directional Structuring and MDL-Based Model Selection for Heterogeneous Data Compression
inferred← citeshttps://doi.org/10.1109/twc.2015.2468729openalex-snapshot
Wireless Network Compression Via Memory-Enabled Overhearing Helpers
inferred← citeshttps://doi.org/10.1109/wcsp.2014.6992186openalex-snapshot
Packet-level clustering for memory-assisted compression of network packets
inferred← citeshttps://doi.org/10.1162/neco_a_01251openalex-snapshot
Optimal Sampling of Parametric Families: Implications for Machine Learning
inferred← citeshttps://doi.org/10.1186/s13638-017-1019-8openalex-snapshot
Statistical spectrum occupancy prediction for dynamic spectrum access: a classification
inferred← citeshttps://doi.org/10.1198/016214501753168398openalex-snapshot
Model Selection and the Principle of Minimum Description Length
inferred← citeshttps://doi.org/10.1214/009053604000000553openalex-snapshot
Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory
inferred← citeshttps://doi.org/10.1214/aos/1024691358openalex-snapshot
Information theory and superefficiency
inferred← citeshttps://doi.org/10.1214/aos/1030741081openalex-snapshot
Mutual information, metric entropy and cumulative relative entropy risk
inferred← citeshttps://doi.org/10.1561/0100000090openalex-snapshot
Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
inferred← citeshttps://doi.org/10.1613/jair.1491openalex-snapshot
On Prediction Using Variable Order Markov Models
inferred← citeshttps://doi.org/10.3390/e25081199openalex-snapshot
A Universal Random Coding Ensemble for Sample-Wise Lossy Compression
inferred← citeshttps://doi.org/10.3390/e26020116openalex-snapshot
Lossy Compression of Individual Sequences Revisited: Fundamental Limits of Finite-State Encoders
inferred← citeshttps://doi.org/10.4310/cis.2011.v11.n4.a3openalex-snapshot
On optimum strategies for minimizing the exponential moments of a loss function
inferred← citeshttps://doi.org/10.48550/arxiv.0708.2310openalex-snapshot
Benefiting from Disorder: Source Coding for Unordered Data
inferred← citeshttps://doi.org/10.48550/arxiv.1206.4245openalex-snapshot
On Lossless Universal Compression of Distributed Identical Sources
inferred← citeshttps://doi.org/10.48550/arxiv.1301.5096openalex-snapshot
Minimax Filtering via Relations between Information and Estimation
inferred← citeshttps://doi.org/10.48550/arxiv.1411.7607openalex-snapshot
Universal Compression of a Mixture of Parametric Sources with Side Information
inferred← citeshttps://doi.org/10.48550/arxiv.1612.02542openalex-snapshot
Minimum Rates of Approximate Sufficient Statistics
inferred← citeshttps://doi.org/10.48550/arxiv.1901.03625openalex-snapshot
Universal Compression with Side Information from a Correlated Source
inferred← citeshttps://doi.org/10.48550/arxiv.2002.02950openalex-snapshot
Logistic Regression Regret: What's the Catch?
inferred← citeshttps://doi.org/10.48550/arxiv.2102.00050openalex-snapshot
Sequential prediction under log-loss and misspecification
inferred← citeshttps://doi.org/10.48550/arxiv.2103.13192openalex-snapshot
On Sequential Bayesian Optimization with Pairwise Comparison.
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.