On the public citation graph

Second-order noiseless source coding theorems

0 signed · 83 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-4615-8162-8_8openalex-snapshot
Basic Properties of Strong Mixing Conditions
inferredcites →https://doi.org/10.1023/a:1022610816550openalex-snapshot
Asymptotic Recurrence and Waiting Times for Stationary Processes
inferredcites →https://doi.org/10.1090/memo/0161openalex-snapshot
Almost sure invariance principles for partial sums of weakly dependent random variables
inferredcites →https://doi.org/10.1109/18.75241openalex-snapshot
Sample converses in source coding theory
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.1137/1107036openalex-snapshot
Some Limit Theorems for Stationary Processes
inferredcites →https://doi.org/10.1214/aop/1024404290openalex-snapshot
String matching bounds via coding
inferredcites →https://doi.org/10.2307/2982422openalex-snapshot
Markov Chains with Stationary Transition Probabilities.

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.1016/j.cam.2023.115710openalex-snapshot
Weighted (residual) varentropy and its applications
inferred← citeshttps://doi.org/10.1016/j.fmre.2025.12.032openalex-snapshot
Finite-blocklength information theory
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.10.007openalex-snapshot
Renewal theory in the analysis of tries and strings
inferred← citeshttps://doi.org/10.1017/s0021900200009207openalex-snapshot
Hurst Index of Functions of Long-Range-Dependent Markov Chains
inferred← citeshttps://doi.org/10.1080/00949655.2025.2458718openalex-snapshot
Weighted past and paired dynamic varentropy measures, their properties, usefulness and inferences
inferred← citeshttps://doi.org/10.1093/ietfec/e90-a.12.2965openalex-snapshot
A Note on the -Overflow Probability of Lossless Codes
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.915693openalex-snapshot
Critical behavior in lossy source coding
inferred← citeshttps://doi.org/10.1109/acssc.1997.679123openalex-snapshot
Second-order analysis of lossless and lossy versions of Lempel-Ziv codes
inferred← citeshttps://doi.org/10.1109/allerton.2013.6736617openalex-snapshot
Non-asymptotic bounds on fixed length source coding for Markov chains
inferred← citeshttps://doi.org/10.1109/ciss.2012.6310950openalex-snapshot
Lossless data compression rate: Asymptotics and non-asymptotics
inferred← citeshttps://doi.org/10.1109/iccs.2012.6406110openalex-snapshot
Achievable second-order coding rates for the wiretap channel
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.2000.866334openalex-snapshot
On the variance and the probability of length overflow of lossless codes
inferred← citeshttps://doi.org/10.1109/isit.2007.4557265openalex-snapshot
On the -overflow probability of lossless codes
inferred← citeshttps://doi.org/10.1109/isit.2009.5205945openalex-snapshot
Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code
inferred← citeshttps://doi.org/10.1109/isit.2010.5513617openalex-snapshot
Compressing a long range dependent renewal process
inferred← citeshttps://doi.org/10.1109/isit.2011.6033753openalex-snapshot
Coding theorems on the worst-case redundancy of fixed-length coding for a general source
inferred← citeshttps://doi.org/10.1109/isit.2012.6283022openalex-snapshot
Information spectrum approach to overflow probability of variable-length codes with conditional cost function
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.2012.6284673openalex-snapshot
Second-order achievable rates in random number generation for mixed sources
inferred← citeshttps://doi.org/10.1109/isit.2013.6620525openalex-snapshot
Optimal lossless compression: Source varentropy and dispersion
inferred← citeshttps://doi.org/10.1109/isit.2013.6620526openalex-snapshot
Lossless compression with moderate error probability
inferred← citeshttps://doi.org/10.1109/isit.2013.6620571openalex-snapshot
Second-order Slepian-Wolf coding theorems for non-mixed and mixed sources
inferred← citeshttps://doi.org/10.1109/isit.2013.6620787openalex-snapshot
Non-asymptotic and second-order achievability bounds for source coding with side-information
inferred← citeshttps://doi.org/10.1109/isit.2015.7282803openalex-snapshot
Fundamental limit and pointwise asymptotics of the Bayes code for Markov sources
inferred← citeshttps://doi.org/10.1109/isit.2019.8849241openalex-snapshot
Semi-Finite Length Analysis for Secure Random Number Generation
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174326openalex-snapshot
Lossless Data Compression with Side Information: Nonasymptotics and Dispersion
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174518openalex-snapshot
Registration of Finite Resolution Images: a Second-order Analysis
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517996openalex-snapshot
Symmetry and the Entropy of Small-World Structures and Graphs
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11654073openalex-snapshot
Universal Compression at Pragmatic Rates
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11654090openalex-snapshot
Sample Complexity Bounds for Lossless Source Coding
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195460openalex-snapshot
Lossless Data Compression at Pragmatic Rates
inferred← citeshttps://doi.org/10.1109/ita.2012.6181789openalex-snapshot
Long range dependent Markov chains with applications
inferred← citeshttps://doi.org/10.1109/itw.2007.4313131openalex-snapshot
Universal Fixed-Length Coding Redundancy
inferred← citeshttps://doi.org/10.1109/itw48936.2021.9611461openalex-snapshot
$(\epsilon, n)$ Fixed-Length Strong Coordination Capacity
inferred← citeshttps://doi.org/10.1109/itw62417.2025.11240252openalex-snapshot
Fundamental Limits on Overflow Probability for Variable-Length Codes with Codeword Cost: A Smooth Rényi Entropy Approach
inferred← citeshttps://doi.org/10.1109/tccn.2025.3547964openalex-snapshot
On the Second-Order Achievabilities of Indirect Quadratic Lossy Source Coding
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.2004.840858openalex-snapshot
On the Asymptotic Redundancy of Lossless Block Coding With Two Codeword Lengths
inferred← citeshttps://doi.org/10.1109/tit.2008.928985openalex-snapshot
Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness
inferred← citeshttps://doi.org/10.1109/tit.2012.2215836openalex-snapshot
Second-Order Resolvability, Intrinsic Randomness, and Fixed-Length Source Coding for Mixed Sources: Information Spectrum Approach
inferred← citeshttps://doi.org/10.1109/tit.2013.2276628openalex-snapshot
A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
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.2013.2291231openalex-snapshot
On the Dispersions of Three Network Information Theory Problems
inferred← citeshttps://doi.org/10.1109/tit.2014.2324555openalex-snapshot
Second-Order Coding Rates for Channels With State
inferred← citeshttps://doi.org/10.1109/tit.2014.2339231openalex-snapshot
Second-Order Slepian-Wolf Coding Theorems for Non-Mixed and Mixed Sources
inferred← citeshttps://doi.org/10.1109/tit.2015.2400994openalex-snapshot
Nonasymptotic and Second-Order Achievability Bounds for Coding With Side-Information
inferred← citeshttps://doi.org/10.1109/tit.2016.2535174openalex-snapshot
Security Analysis of $\varepsilon $ -Almost Dual Universal2Hash Functions: Smoothing of Min Entropy Versus Smoothing of Rényi Entropy of Order 2
inferred← citeshttps://doi.org/10.1109/tit.2019.2941888openalex-snapshot
Overflow Probability of Variable-Length Codes With Codeword Cost
inferred← citeshttps://doi.org/10.1109/tit.2021.3062614openalex-snapshot
Fundamental Limits of Lossless Data Compression With Side Information
inferred← citeshttps://doi.org/10.1109/tit.2024.3409371openalex-snapshot
General Weighted Information and Relative Information Generating Functions With Properties
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.1162/089976603321780272openalex-snapshot
Estimation of Entropy and Mutual Information
inferred← citeshttps://doi.org/10.1561/0100000086openalex-snapshot
Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities
inferred← citeshttps://doi.org/10.1561/9781601988539openalex-snapshot
Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities
inferred← citeshttps://doi.org/10.1587/transfun.e93.a.1650openalex-snapshot
Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
inferred← citeshttps://doi.org/10.1587/transfun.e94.a.2083openalex-snapshot
On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information
inferred← citeshttps://doi.org/10.1587/transfun.e94.a.2220openalex-snapshot
An Analysis of Slepian-Wolf Coding Problem Based on the Asymptotic Normality
inferred← citeshttps://doi.org/10.1587/transfun.e98.a.2407openalex-snapshot
Evaluation of the Bayes Code from Viewpoints of the Distribution of Its Codeword Lengths
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/e22040460openalex-snapshot
Finite-Length Analyses for Source and Channel Coding on Markov Chains
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/e28080898openalex-snapshot
Statistics of the Compression Ratio of a Variable-to-Variable Code: Exact Moments and Asymptotic Behavior
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.4310/cis.2022.v22.n2.a5openalex-snapshot
Compression and symmetry of small-world graphs and structures
inferred← citeshttps://doi.org/10.46298/dmtcs.2765openalex-snapshot
Renewal theory in analysis of tries and strings: Extended abstract
inferred← citeshttps://doi.org/10.48550/arxiv.0912.2174openalex-snapshot
Renewal theory in analysis of tries and strings
inferred← citeshttps://doi.org/10.48550/arxiv.1111.1977openalex-snapshot
On Refined Versions of the Azuma-Hoeffding Inequality with Applications in Information Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1207.2505openalex-snapshot
Second-Order Slepian-Wolf Coding Theorems for Non-Mixed and Mixed Sources
inferred← citeshttps://doi.org/10.48550/arxiv.1212.2668openalex-snapshot
Lossless Data Compression at Finite Blocklengths
inferred← citeshttps://doi.org/10.48550/arxiv.1811.00262openalex-snapshot
Semi-Finite Length Analysis for Information Theoretic Tasks
inferred← citeshttps://doi.org/10.48550/arxiv.2001.03869openalex-snapshot
Finite-Sample Analysis of Image Registration
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.