On the public citation graph

Sample converses in source coding theory

0 signed · 75 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.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/bf02592011openalex-snapshot
Contributions to information theory for abstract alphabets
inferredcites →https://doi.org/10.1016/b978-0-12-085520-9.50018-6openalex-snapshot
An Almost Sure Convergence Theorem For Sequences of Random Variables Selected From Log-Convex Sets
inferredcites →https://doi.org/10.1080/00401706.1970.10488656openalex-snapshot
A Graduate Course in Probability
inferredcites →https://doi.org/10.1109/tit.1977.1055804openalex-snapshot
Variable-rate, weakly- and strongly-universal source coding subject to a fidelity constraint (Ph.D. Thesis abstr.)
inferredcites →https://doi.org/10.1109/tit.1978.1055914openalex-snapshot
Block coding for an ergodic source relative to a zero-one valued fidelity criterion
inferredcites →https://doi.org/10.1109/tit.1978.1055960openalex-snapshot
A unified approach to weak universal source coding
inferredcites →https://doi.org/10.1111/j.2517-6161.1968.tb00749.xopenalex-snapshot
The Ergodic Theory of Subadditive Stochastic Processes
inferredcites →https://doi.org/10.1214/aop/1176990840openalex-snapshot
Universal Almost Sure Data Compression
inferredcites →https://doi.org/10.1214/aop/1176991794openalex-snapshot
A Sandwich Proof of the Shannon-McMillan-Breiman Theorem
inferredcites →https://doi.org/10.2307/2343845openalex-snapshot
A Graduate Course in Probability.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118032770.biblioopenalex-snapshot
Bibliography
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-1-4757-6048-4_36openalex-snapshot
Universal Lossless Coding of Sources with Large and Unbounded Alphabets
inferred← citeshttps://doi.org/10.1017/s0143385700007653openalex-snapshot
Algorithmic complexity of points in dynamical systems
inferred← citeshttps://doi.org/10.1109/18.104325openalex-snapshot
The entropy theorem via coding bounds
inferred← citeshttps://doi.org/10.1109/18.179376openalex-snapshot
Distortion program-size complexity with respect to a fidelity criterion and rate-distortion function
inferred← citeshttps://doi.org/10.1109/18.256497openalex-snapshot
Strongly consistent code-based identification and order estimation for constrained finite-state model classes
inferred← citeshttps://doi.org/10.1109/18.259634openalex-snapshot
A survey of the theory of source coding with a fidelity criterion
inferred← citeshttps://doi.org/10.1109/18.259648openalex-snapshot
Asymptotic properties of data compression and suffix trees
inferred← citeshttps://doi.org/10.1109/18.481775openalex-snapshot
Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity
inferred← citeshttps://doi.org/10.1109/18.481794openalex-snapshot
Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
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.490547openalex-snapshot
An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models
inferred← citeshttps://doi.org/10.1109/18.605570openalex-snapshot
On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources
inferred← citeshttps://doi.org/10.1109/18.605576openalex-snapshot
An information-spectrum approach to source coding theorems with a fidelity criterion
inferred← citeshttps://doi.org/10.1109/18.605604openalex-snapshot
Second-order noiseless source coding theorems
inferred← citeshttps://doi.org/10.1109/18.623145openalex-snapshot
Fixed-slope universal lossy data compression
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.720532openalex-snapshot
The interactions between ergodic theory and information theory
inferred← citeshttps://doi.org/10.1109/18.720552openalex-snapshot
Lossy source coding
inferred← citeshttps://doi.org/10.1109/18.75240openalex-snapshot
Strong converses in source coding relative to a fidelity criterion
inferred← citeshttps://doi.org/10.1109/18.761253openalex-snapshot
On the redundancy of lossy source coding with abstract alphabets
inferred← citeshttps://doi.org/10.1109/18.817514openalex-snapshot
Pointwise redundancy in lossy data compression and universal lossy data compression
inferred← citeshttps://doi.org/10.1109/18.841161openalex-snapshot
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models
inferred← citeshttps://doi.org/10.1109/18.915693openalex-snapshot
Critical behavior in lossy source coding
inferred← citeshttps://doi.org/10.1109/18.945239openalex-snapshot
Universal lossless data compression with side information by using a conditional MPM grammar transform
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.1997.613361openalex-snapshot
Two refinements to Shannon's source coding theorem
inferred← citeshttps://doi.org/10.1109/isit.2003.1228181openalex-snapshot
Mismatched codebooks and the role of entropy-coding in lossy data compression
inferred← citeshttps://doi.org/10.1109/isit.2004.1365258openalex-snapshot
On universal types
inferred← citeshttps://doi.org/10.1109/isit.2004.1365500openalex-snapshot
The empirical distribution of rate - constrained source codes
inferred← citeshttps://doi.org/10.1109/isit.2006.261685openalex-snapshot
On Information Divergence Measures and a Unified Typicality
inferred← citeshttps://doi.org/10.1109/isit.2007.4557191openalex-snapshot
Twice-Universal Simulation of Markov Sources and Individual Sequences
inferred← citeshttps://doi.org/10.1109/isit.2009.5205934openalex-snapshot
A strong converse for a collection of network source coding problems
inferred← citeshttps://doi.org/10.1109/isit.2011.6034154openalex-snapshot
A strong converse in source coding for super-source networks
inferred← citeshttps://doi.org/10.1109/isit.2012.6284209openalex-snapshot
Pointwise lossy source coding theorem for sources with memory
inferred← citeshttps://doi.org/10.1109/isit.2013.6620525openalex-snapshot
Optimal lossless compression: Source varentropy and dispersion
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11654137openalex-snapshot
Exact Redundancy for Symmetric Rate-Distortion
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.800493openalex-snapshot
Arbitrary source models and Bayesian codebooks in rate-distortion theory
inferred← citeshttps://doi.org/10.1109/tit.2002.808135openalex-snapshot
Complexity distortion theory
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.830771openalex-snapshot
Universal Entropy Estimation Via Block Sorting
inferred← citeshttps://doi.org/10.1109/tit.2005.856948openalex-snapshot
The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets
inferred← citeshttps://doi.org/10.1109/tit.2005.856982openalex-snapshot
The Empirical Distribution of Rate-Constrained Source Codes
inferred← citeshttps://doi.org/10.1109/tit.2005.860437openalex-snapshot
On universal types
inferred← citeshttps://doi.org/10.1109/tit.2006.872845openalex-snapshot
Mismatched codebooks and the role of entropy coding in lossy data compression
inferred← citeshttps://doi.org/10.1109/tit.2010.2053870openalex-snapshot
Twice-Universal Simulation of Markov Sources and Individual Sequences
inferred← citeshttps://doi.org/10.1109/tit.2010.2080431openalex-snapshot
On Information Divergence Measures and a Unified Typicality
inferred← citeshttps://doi.org/10.1109/tit.2012.2186786openalex-snapshot
Fixed-Length Lossy Compression in the Finite Blocklength Regime
inferred← citeshttps://doi.org/10.1109/tit.2013.2291007openalex-snapshot
Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics
inferred← citeshttps://doi.org/10.1109/tit.2017.2768058openalex-snapshot
A Rate-Distortion Approach to Caching
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.1134/s0032946020010020openalex-snapshot
Entropy and Compression: A Simple Proof of an Inequality of Khinchin-Ornstein-Shields
inferred← citeshttps://doi.org/10.1561/0100000090openalex-snapshot
Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
inferred← citeshttps://doi.org/10.17863/cam.54413openalex-snapshot
Sharp Second-Order Pointwise Asymptotics for Lossless Compression with Side Information.
inferred← citeshttps://doi.org/10.3390/e22060705openalex-snapshot
Sharp Second-Order Pointwise Asymptotics for Lossless Compression with Side Information
inferred← citeshttps://doi.org/10.3390/entropy-e10020071openalex-snapshot
Estimating the Entropy of Binary Time Series: Methodology, Some Theory and a Simulation Study
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.1212.2668openalex-snapshot
Lossless Data Compression at Finite Blocklengths
inferred← citeshttps://doi.org/10.48550/arxiv.1610.07304openalex-snapshot
A Rate-Distortion Approach to Caching
inferred← citeshttps://doi.org/10.48550/arxiv.1802.07889openalex-snapshot
Entropy Rate Estimation for Markov Chains with Large State Space
inferred← citeshttps://doi.org/10.7907/j8jp-r695openalex-snapshot
On Achievable Rate Regions for Source Coding Over Networks
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.