On the public citation graph

The asymptotic redundancy of Bayes rules for Markov chains

0 signed · 59 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.1002/0471200611openalex-snapshot
Elements of Information Theory
inferredcites →https://doi.org/10.1007/978-1-4419-7970-4openalex-snapshot
Entropy and Information Theory
inferredcites →https://doi.org/10.1007/978-1-4757-3982-4openalex-snapshot
Entropy and Information Theory
inferredcites →https://doi.org/10.1007/978-1-4757-4286-2openalex-snapshot
Statistical Decision Theory and Bayesian Analysis
inferredcites →https://doi.org/10.1007/978-3-642-46184-2openalex-snapshot
Random Processes and Learning
inferredcites →https://doi.org/10.1007/bfb0073538openalex-snapshot
Asymptotic Approximations for Probability Integrals
inferredcites →https://doi.org/10.1016/0266-8920(89)90024-6openalex-snapshot
Asymptotic approximations for probability integrals
inferredcites →https://doi.org/10.1109/18.133247openalex-snapshot
A class of distortionless codes designed by Bayes decision theory
inferredcites →https://doi.org/10.1109/18.135641openalex-snapshot
A sequential algorithm for the universal coding of finite memory sources
inferredcites →https://doi.org/10.1109/18.212281openalex-snapshot
Universal redundancy rates do not exist
inferredcites →https://doi.org/10.1109/18.382012openalex-snapshot
The context-tree weighting method: basic properties
inferredcites →https://doi.org/10.1109/18.54897openalex-snapshot
Information-theoretic asymptotics of Bayes methods
inferredcites →https://doi.org/10.1109/18.782149openalex-snapshot
The asymptotic redundancy of Bayes rules for Markov chains
inferredcites →https://doi.org/10.1109/isit.1995.550378openalex-snapshot
Approximation of Bayes code for Markov sources
inferredcites →https://doi.org/10.1109/tit.1977.1055714openalex-snapshot
A universal algorithm for sequential data compression
inferredcites →https://doi.org/10.1109/tit.1981.1056355openalex-snapshot
Efficient universal noiseless source codes
inferredcites →https://doi.org/10.1109/tit.1984.1056936openalex-snapshot
Universal coding, information, prediction, and estimation
inferredcites →https://doi.org/10.2307/2288950openalex-snapshot
Stastical Decision Theory and Bayesian 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.1093/comjnl/bxl045openalex-snapshot
The Structure Function and Distinguishable Models of Data
inferred← citeshttps://doi.org/10.1109/access.2020.2994319openalex-snapshot
Network Traffic Compression With Side Information
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/isit.2003.1228092openalex-snapshot
Precise minimax redundancy for Markov sources
inferred← citeshttps://doi.org/10.1109/isit.2005.1523440openalex-snapshot
Universal delay-limited simulation
inferred← citeshttps://doi.org/10.1109/isit.2011.6033793openalex-snapshot
Results on the redundancy of universal compression for finite-length sequences
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.6284253openalex-snapshot
On lossless universal compression of distributed identical sources
inferred← citeshttps://doi.org/10.1109/isit.2013.6620304openalex-snapshot
Universal variable to fixed-length random number generators for finite memory sources
inferred← citeshttps://doi.org/10.1109/isit.2016.7541787openalex-snapshot
Learning Markov distributions: Does estimation trump compression?
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.2018.8437897openalex-snapshot
Redundancy of Unbounded Memory Markov Classes with Continuity Conditions
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11654037openalex-snapshot
Universal Agnostic Learning for Smooth Parametric Models
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195281openalex-snapshot
Constrained Universal Learning Under Misspecification
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/tit.2003.821993openalex-snapshot
On Universal Simulation of Information Sources Using Training Data
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.2008.2006464openalex-snapshot
Universal Delay-Limited Simulation
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.2012.2191476openalex-snapshot
Counting Markov Types, Balanced Matrices, and Eulerian Graphs
inferred← citeshttps://doi.org/10.1109/tit.2012.2219171openalex-snapshot
Properties of Jeffreys Mixture for Markov Sources
inferred← citeshttps://doi.org/10.1109/tit.2014.2340450openalex-snapshot
On the Data Processing Theorem in the Semi–deterministic Setting
inferred← citeshttps://doi.org/10.1109/tit.2014.2386860openalex-snapshot
Optimal Algorithms for Universal Random Number Generation From Finite Memory Sources
inferred← citeshttps://doi.org/10.1109/tit.2015.2466693openalex-snapshot
A Preadapted Universal Switch Distribution for Testing Hilberg’s Conjecture
inferred← citeshttps://doi.org/10.1109/tit.2015.2470675openalex-snapshot
Hilberg Exponents: New Measures of Long Memory in the Process
inferred← citeshttps://doi.org/10.1109/tit.2021.3133422openalex-snapshot
Finite–State Source–Channel Coding for Individual Source Sequences With Source Side Information at the Decoder
inferred← citeshttps://doi.org/10.1109/tit.2023.3239508openalex-snapshot
Optimal Prediction of Markov Chains With and Without Spectral Gap
inferred← citeshttps://doi.org/10.1109/twc.2015.2468729openalex-snapshot
Wireless Network Compression Via Memory-Enabled Overhearing Helpers
inferred← citeshttps://doi.org/10.1561/0100000090openalex-snapshot
Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
inferred← citeshttps://doi.org/10.1587/transfun.e97.a.2352openalex-snapshot
Asymptotics of Bayesian Inference for a Class of Probabilistic Models under Misspecification
inferred← citeshttps://doi.org/10.2172/764168openalex-snapshot
Final technical report: analysis of molecular data using statistical and evolutionary approaches
inferred← citeshttps://doi.org/10.3390/e18100364openalex-snapshot
Entropy Rate Estimates for Natural Language—A New Extrapolation of Compressed Large-Scale Corpora
inferred← citeshttps://doi.org/10.46298/dmtcs.2768openalex-snapshot
Counting Markov Types
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.1206.4245openalex-snapshot
On Lossless Universal Compression of Distributed Identical Sources
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.1901.03625openalex-snapshot
Universal Compression with Side Information from a Correlated Source
inferred← citeshttps://doi.org/10.48550/arxiv.2107.08778openalex-snapshot
Finite-state source-channel coding for individual sequences with source side information at the decoder
showing the first 40 of 41 · page through all 41
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.