On the public citation graph
A large deviations approach to error exponents in source coding and hypothesis testing
0 signed · 37 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.1002/cpa.3160280102openalex-snapshot
Asymptotic evaluation of certain markov process expectations for large time, I
inferredcites →https://doi.org/10.1002/cpa.3160280206openalex-snapshot
Asymptotic evaluation of certain markov process expectations for large time, II
inferredcites →https://doi.org/10.1007/978-1-4613-8514-1openalex-snapshot
An Introduction to the Theory of Large Deviations
inferredcites →https://doi.org/10.1007/springerreference_205412openalex-snapshot
Large Deviations and Applications
inferredcites →https://doi.org/10.1109/tcom.1972.1091311openalex-snapshot
Rate Distortion Theory: A Mathematical Basis for Data Compression
inferredcites →https://doi.org/10.1109/tit.1979.1056081openalex-snapshot
The source coding theorem revisited: A combinatorial approach
inferredcites →https://doi.org/10.1109/tit.1981.1056377openalex-snapshot
The error exponent for the noiseless encoding of finite ergodic Markov sources
inferredcites →https://doi.org/10.1109/tit.1985.1057036openalex-snapshot
Large deviations, hypotheses testing, and source coding for finite Markov chains
inferredcites →https://doi.org/10.1137/1.9781611970630openalex-snapshot
Some Limit Theorems in Statistics
inferredcites →https://doi.org/10.1214/aop/1176993370openalex-snapshot
Large Deviations for a General Class of Random Vectors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jmaa.1997.5850openalex-snapshot
Expectations for Nonreversible Markov Chains
inferred← citeshttps://doi.org/10.1007/978-0-387-48945-2_5openalex-snapshot
Entropy, Inference, and Channel Coding
inferred← citeshttps://doi.org/10.1007/978-0-387-76544-0_12openalex-snapshot
Detection of Markov Chains with Known Parameters
inferred← citeshttps://doi.org/10.1007/978-0-387-76544-0_13openalex-snapshot
Detection of Markov Chains with Unknown Parameters
inferred← citeshttps://doi.org/10.1007/978-3-030-13046-6_4openalex-snapshot
Lectures on Entropy. I: Information-Theoretic Notions
inferred← citeshttps://doi.org/10.1007/978-3-642-36899-8_14openalex-snapshot
Multiple Objects: Error Exponents in Hypotheses Testing and Identification
inferred← citeshttps://doi.org/10.1016/j.sigpro.2012.09.003openalex-snapshot
Divergence measures for statistical data processing—An annotated bibliography
inferred← citeshttps://doi.org/10.1063/5.0136432openalex-snapshot
Optimal Neyman-Pearson procedure of detection with side information for separate groups of arbitrarily varying Markov distributions
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.490546openalex-snapshot
An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
inferred← citeshttps://doi.org/10.1109/18.532889openalex-snapshot
The optimal error exponent for Markov order estimation
inferred← citeshttps://doi.org/10.1109/iccis.2011.27openalex-snapshot
A Detection Method Research for Data Hiding Based on Markov Chain
inferred← citeshttps://doi.org/10.1109/isit.2004.1365516openalex-snapshot
Error exponents for channel coding and signal constellation design
inferred← citeshttps://doi.org/10.1109/isit.2009.5205598openalex-snapshot
On arbitrarily varying Markov source coding and hypothesis LAO testing by non-informed statistician
inferred← citeshttps://doi.org/10.1109/isit.2013.6620616openalex-snapshot
Controlled sensing for multihypothesis testing based on Markovian observations
inferred← citeshttps://doi.org/10.1109/isit.2018.8437648openalex-snapshot
Guessing noise, not code-words
inferred← citeshttps://doi.org/10.1109/jsac.2006.879411openalex-snapshot
Error exponents for channel coding with application to signal constellation design
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366819openalex-snapshot
A Chernoff bound for random walks on expander graphs
inferred← citeshttps://doi.org/10.1109/tifs.2006.873595openalex-snapshot
Steganalysis for Markov Cover Data With Applications to Images
inferred← citeshttps://doi.org/10.1109/tit.2004.825040openalex-snapshot
CsiszÁr's Cutoff Rates for the General Hypothesis Testing Problem
inferred← citeshttps://doi.org/10.1109/tit.2006.885539openalex-snapshot
Symbol-Based Modeling and Coding of Block Markov Sources
inferred← citeshttps://doi.org/10.1109/tit.2007.896887openalex-snapshot
Source Coding With Feed-Forward: Rate-Distortion Theorems and Error Exponents for a General Source
inferred← citeshttps://doi.org/10.1109/tit.2019.2896110openalex-snapshot
Capacity-Achieving Guessing Random Additive Noise Decoding
inferred← citeshttps://doi.org/10.1137/s0097539794268765openalex-snapshot
A Chernoff Bound for Random Walks on Expander Graphs
inferred← citeshttps://doi.org/10.1561/0100000008openalex-snapshot
Reliability Criteria in Information Theory and in Statistical Hypothesis Testing
inferred← citeshttps://doi.org/10.1561/9781601980472openalex-snapshot
Reliability Criteria in Information Theory and in Statistical Hypothesis Testing
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.