On the public citation graph

Entropy bounds for constrained two-dimensional random fields

0 signed · 53 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.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1016/0304-4149(94)90132-5openalex-snapshot
Percolation and the hard-core lattice gas model
inferredcites →https://doi.org/10.1017/s002190020010525xopenalex-snapshot
A curious binary lattice process
inferredcites →https://doi.org/10.1017/s0143385700007859openalex-snapshot
Non-uniqueness of measures of maximal entropy for subshifts of finite type
inferredcites →https://doi.org/10.1090/memo/0066openalex-snapshot
The undecidability of the domino problem
inferredcites →https://doi.org/10.1103/physrev.65.117openalex-snapshot
Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
inferredcites →https://doi.org/10.1109/18.508852openalex-snapshot
Partially hidden Markov models
inferredcites →https://doi.org/10.1109/5.18626openalex-snapshot
A tutorial on hidden Markov models and selected applications in speech recognition
inferredcites →https://doi.org/10.1109/tit.1965.1053827openalex-snapshot
Classification of binary random patterns
inferredcites →https://doi.org/10.1137/s089548019528993xopenalex-snapshot
The Number of Independent Sets in a Grid Graph
inferredcites →https://doi.org/10.1214/aop/1176989121openalex-snapshot
Local Characteristics, Entropy and Limit Theorems for Spanning Trees and Domino Tilings Via Transfer-Impedances

What points at this work

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

inferred← citeshttps://doi.org/10.1006/cviu.2000.0835openalex-snapshot
Image Analysis and Computer Vision: 1999
inferred← citeshttps://doi.org/10.1007/978-0-387-21696-6_6openalex-snapshot
Multi-Dimensional Capacity, Pressure and Hausdorff Dimension
inferred← citeshttps://doi.org/10.1007/978-3-319-17296-5_1openalex-snapshot
Capacity of Higher-Dimensional Constrained Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-47221-7_7openalex-snapshot
Hard Core via PCA: Entropy Bounds
inferred← citeshttps://doi.org/10.1016/j.aam.2004.08.005openalex-snapshot
Theory of computation of multidimensional entropy with an application to the monomer–dimer problem
inferred← citeshttps://doi.org/10.1109/18.749031openalex-snapshot
Efficient code constructions for certain two-dimensional constraints
inferred← citeshttps://doi.org/10.1109/18.841179openalex-snapshot
Capacity bounds for the three-dimensional (0,1) run length limited channel
inferred← citeshttps://doi.org/10.1109/18.887878openalex-snapshot
Bounds on the capacity of constrained two-dimensional codes
inferred← citeshttps://doi.org/10.1109/18.887879openalex-snapshot
Partial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels
inferred← citeshttps://doi.org/10.1109/18.915673openalex-snapshot
Efficient coding schemes for the hard-square model
inferred← citeshttps://doi.org/10.1109/26.681399openalex-snapshot
Two-dimensional low-pass filtering codes
inferred← citeshttps://doi.org/10.1109/83.799880openalex-snapshot
Adaptive partially hidden Markov models with application to bilevel image coding
inferred← citeshttps://doi.org/10.1109/dcc.1999.785681openalex-snapshot
Image coding using Markov models with hidden states
inferred← citeshttps://doi.org/10.1109/glocom.2000.891251openalex-snapshot
On the two-dimensional binary (d,k) constrained array
inferred← citeshttps://doi.org/10.1109/iscit.2004.1412888openalex-snapshot
The algebraic properties of the 2-dimensional
inferred← citeshttps://doi.org/10.1109/isit.1998.708656openalex-snapshot
An upper bound on the entropy of constrained 2D fields
inferred← citeshttps://doi.org/10.1109/isit.1998.709017openalex-snapshot
Simple models of two-dimensional information sources and codes
inferred← citeshttps://doi.org/10.1109/isit.2002.1023628openalex-snapshot
Bounds on the capacity of weakly constrained two-dimensional codes
inferred← citeshttps://doi.org/10.1109/isit.2003.1228123openalex-snapshot
Cascading constrained 2-D arrays using periodic merging arrays
inferred← citeshttps://doi.org/10.1109/isit.2004.1365197openalex-snapshot
Block codes for the hard-square model
inferred← citeshttps://doi.org/10.1109/isit.2004.1365198openalex-snapshot
Finite state models of constrained 2D data
inferred← citeshttps://doi.org/10.1109/isit.2004.1365199openalex-snapshot
Analysis of bit-stuffing codes and lower bounds on capacity for 2-D constrained arrays using quasi-stationary measures
inferred← citeshttps://doi.org/10.1109/isit.2006.262023openalex-snapshot
On Capacity of a Constrained Two-Dimensional Channel in Presence of Violations
inferred← citeshttps://doi.org/10.1109/isit.2006.262112openalex-snapshot
Capacity Lower Bounds for Two-Dimensional M-ary (0, k) and (d, ¿) Runlength-limited Channels
inferred← citeshttps://doi.org/10.1109/isit.2009.5206052openalex-snapshot
Extending models for two-dimensional constraints
inferred← citeshttps://doi.org/10.1109/isit.2017.8007062openalex-snapshot
The number of independent sets in hexagonal graphs
inferred← citeshttps://doi.org/10.1109/itw.2004.1405289openalex-snapshot
Enumeration algorithms for constructing (d/sub 1/, ∞, d/sub 2/, ∞) run length limited arrays: capacity estimates and coding schemes
inferred← citeshttps://doi.org/10.1109/itw.2005.1531862openalex-snapshot
Capacity of M-ary 2-D RLL constraints for optical recording channels
inferred← citeshttps://doi.org/10.1109/tcomm.2009.06.080220openalex-snapshot
Capacity bounds for two-dimensional asymmetric M-ary (0, κ) and (d,α) runlength-limited channels
inferred← citeshttps://doi.org/10.1109/tit.2000.887895openalex-snapshot
Correction to "Entropy bounds for constrained two-dimensional random fields"
inferred← citeshttps://doi.org/10.1109/tit.2002.1003825openalex-snapshot
Writing sequences on the plane
inferred← citeshttps://doi.org/10.1109/tit.2003.815766openalex-snapshot
Asymptotic capacity of two-dimensional channels with checkerboard constraints
inferred← citeshttps://doi.org/10.1109/tit.2005.851734openalex-snapshot
Block Codes for the Hard-Square Model
inferred← citeshttps://doi.org/10.1109/tit.2005.853316openalex-snapshot
Zero/Positive Capacities of Two-Dimensional Runlength-Constrained Arrays
inferred← citeshttps://doi.org/10.1109/tit.2005.858988openalex-snapshot
Fields From Markov Chains
inferred← citeshttps://doi.org/10.1109/tit.2006.876354openalex-snapshot
Two-dimensional runlength constrained arrays with equal horizontal and vertical constraints
inferred← citeshttps://doi.org/10.1109/tit.2007.892781openalex-snapshot
Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard Constraints
inferred← citeshttps://doi.org/10.1109/tit.2009.2027505openalex-snapshot
Block Pickard Models for Two-Dimensional Constraints
inferred← citeshttps://doi.org/10.1214/11-aop681openalex-snapshot
Approximating the hard square entropy constant with probabilistic methods
inferred← citeshttps://doi.org/10.25596/jalc-2005-465openalex-snapshot
Coding of Two-Dimensional Constraints of Finite Type by Substitutions
inferred← citeshttps://doi.org/10.4007/annals.2010.171.2011openalex-snapshot
A characterization of the entropies of multidimensional shifts of finite type
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.