On the public citation graph
A class of finitary codes
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.
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/bf01609158openalex-snapshot
A family of codes between some Markov and Bernoulli schemes
inferredcites →https://doi.org/10.1017/s0305004100051756openalex-snapshot
Representation of systems of measurable sets
inferredcites →https://doi.org/10.1090/s0002-9904-1963-10924-6openalex-snapshot
On the isomorphism problem for Bernoulli schemes
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-1-4899-6696-4_1openalex-snapshot
A Characterization of Those Processes Finitarily Isomorphic to a Bernoulli Shift
inferred← citeshttps://doi.org/10.1007/978-3-0348-8968-1_34openalex-snapshot
Information, Entropy and Bernoulli Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-12523-7_3openalex-snapshot
Shannon’s Model for Continuous Transmission
inferred← citeshttps://doi.org/10.1007/bf00531605openalex-snapshot
Finitary coding of Markov random fields
inferred← citeshttps://doi.org/10.1007/bf00531740openalex-snapshot
Deux sch�mas de bernoulli d'alphabet d�nombrable et d'entropie infinie sont finitairement isomorphes
inferred← citeshttps://doi.org/10.1007/bf00535166openalex-snapshot
Finitary codes between Markov processes
inferred← citeshttps://doi.org/10.1007/bf02760609openalex-snapshot
Finitary isomorphisms of irreducible Markov shifts
inferred← citeshttps://doi.org/10.1007/bf02761830openalex-snapshot
Almost topological dynamical systems
inferred← citeshttps://doi.org/10.1007/bf02762380openalex-snapshot
Monotone factors of I.I.D. processes
inferred← citeshttps://doi.org/10.1007/bf02810676openalex-snapshot
Code length between Markov processes
inferred← citeshttps://doi.org/10.1007/s00440-016-0700-xopenalex-snapshot
A monotone isomorphism theorem
inferred← citeshttps://doi.org/10.1007/s11854-011-0001-3openalex-snapshot
Universally measure-preserving homeomorphisms of cantor minimal systems
inferred← citeshttps://doi.org/10.1007/s11856-008-1002-5openalex-snapshot
Any two irreducible Markov chains of equal entropy are finitarily Kakutani equivalent
inferred← citeshttps://doi.org/10.1007/s11856-009-0117-7openalex-snapshot
Any two irreducible Markov chains are finitarily orbit equivalent
inferred← citeshttps://doi.org/10.1007/s11856-019-1890-6openalex-snapshot
Finitary isomorphisms of some infinite entropy Bernoulli flows
inferred← citeshttps://doi.org/10.1007/s11856-022-2328-0openalex-snapshot
Finitary isomorphisms of renewal point processes and continuous-time regenerative processes
inferred← citeshttps://doi.org/10.1016/j.topol.2004.08.012openalex-snapshot
Some remarks on output measures
inferred← citeshttps://doi.org/10.1016/s0019-3577(09)80019-0openalex-snapshot
Finitary isomorphism of some renewal processes to Bernoulli schemes
inferred← citeshttps://doi.org/10.1016/s0019-3577(97)89136-7openalex-snapshot
The finitary coding of two Bernoulli schemes with unequal entropies has finite expectation
inferred← citeshttps://doi.org/10.1017/etds.2018.74openalex-snapshot
Equivariant thinning over a free group
inferred← citeshttps://doi.org/10.1080/17442508.2011.570446openalex-snapshot
Ergodic description of STIT tessellations
inferred← citeshttps://doi.org/10.1090/s0273-0979-1979-14633-0openalex-snapshot
The finitary isomorphism theorem for Markov shifts
inferred← citeshttps://doi.org/10.1090/tran/6489openalex-snapshot
Ergodic universality of some topological dynamical systems
inferred← citeshttps://doi.org/10.1090/tran/8776openalex-snapshot
On the failure of Ornstein theory in the finitary category
inferred← citeshttps://doi.org/10.1109/18.556116openalex-snapshot
Interval algorithm for random number generation
inferred← citeshttps://doi.org/10.1109/icc.2015.7249014openalex-snapshot
On locally decodable source coding
inferred← citeshttps://doi.org/10.1112/plms/pdl018openalex-snapshot
Universal finitary codes with exponential tails
inferred← citeshttps://doi.org/10.1214/074921706000000284openalex-snapshot
Finitary Codes, a short survey
inferred← citeshttps://doi.org/10.1214/18-aop1332openalex-snapshot
Finitary isomorphisms of Poisson point processes
inferred← citeshttps://doi.org/10.1214/19-aop1405openalex-snapshot
Finitary codings for spatial mixing Markov random fields
inferred← citeshttps://doi.org/10.1214/19-aop1412openalex-snapshot
Finitary isomorphisms of Brownian motions
inferred← citeshttps://doi.org/10.1214/19-aop1417openalex-snapshot
Finitely dependent processes are finitary
inferred← citeshttps://doi.org/10.1214/23-aop1642openalex-snapshot
Isomorphisms of Poisson systems over locally compact groups
inferred← citeshttps://doi.org/10.1214/23-ejp950openalex-snapshot
Random interlacement is a factor of i.i.d.
inferred← citeshttps://doi.org/10.1214/aop/1022677456openalex-snapshot
On the Existence and Nonexistence of Finitary Codings for a Class of Random Fields
inferred← citeshttps://doi.org/10.1214/aop/1068646374openalex-snapshot
Finitary coding for the one-dimensional ${T,T^{-1}}$ process with drift
inferred← citeshttps://doi.org/10.1214/aos/1176348543openalex-snapshot
Iterating Von Neumann's Procedure for Extracting Random Bits
inferred← citeshttps://doi.org/10.1214/ecp.v10-1134openalex-snapshot
Poisson Thinning by Monotone Factors
inferred← citeshttps://doi.org/10.1216/rmj-2012-42-1-293openalex-snapshot
On the marker method for constructing finitary isomorphisms
inferred← citeshttps://doi.org/10.2140/memocs.2016.4.461openalex-snapshot
Lucio Russo: probability theory and current interests
inferred← citeshttps://doi.org/10.2307/1971117openalex-snapshot
Bernoulli Schemes of the Same Entropy are Finitarily Isomorphic
inferred← citeshttps://doi.org/10.2977/prims/1201011787openalex-snapshot
Irrational Rotation of the Circle and the Binary Odometer are Finitarily Orbit Equivalent
inferred← citeshttps://doi.org/10.37236/6openalex-snapshot
Finite Factors of Bernoulli Schemes and Distinguishing Labelings of Directed Graphs
inferred← citeshttps://doi.org/10.3934/jmd.2012.6.427openalex-snapshot
Weak mixing suspension flows over shifts of finite type are universal
inferred← citeshttps://doi.org/10.3934/jmd.2021005openalex-snapshot
The orbital equivalence of Bernoulli actions and their Sinai factors
inferred← citeshttps://doi.org/10.3934/jmd.2024001openalex-snapshot
Entropy-efficient finitary codings
inferred← citeshttps://doi.org/10.3934/jmd.2024016openalex-snapshot
Sinai factors of nonsingular systems: Bernoulli shifts and Anosov flows
inferred← citeshttps://doi.org/10.4064/cm110-2-4openalex-snapshot
Finitary orbit equivalence and measured Bratteli diagrams
inferred← citeshttps://doi.org/10.4064/fm198-2-5openalex-snapshot
The Morse minimal system is finitarily Kakutani equivalent to the binary odometer
inferred← citeshttps://doi.org/10.4064/sm201013-7-4openalex-snapshot
Some factors of nonsingular Bernoulli shifts
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.