On the public citation graph
Efficient code constructions for certain two-dimensional constraints
0 signed · 60 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/bf01418780openalex-snapshot
Undecidability and nonperiodicity for tilings of the plane
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1038/scientificamerican1195-70openalex-snapshot
Holographic Memories
inferredcites →https://doi.org/10.1090/memo/0066openalex-snapshot
The undecidability of the domino problem
inferredcites →https://doi.org/10.1109/18.104336openalex-snapshot
New lower bounds for asymmetric and unidirectional codes
inferredcites →https://doi.org/10.1109/18.259664openalex-snapshot
Enumerable multitrack (d, k) block codes
inferredcites →https://doi.org/10.1109/18.481792openalex-snapshot
Conservative arrays: multidimensional modulation codes for holographic recording
inferredcites →https://doi.org/10.1109/18.490545openalex-snapshot
Design of some new efficient balanced codes
inferredcites →https://doi.org/10.1109/18.567731openalex-snapshot
Cascading methods for runlength-limited arrays
inferredcites →https://doi.org/10.1109/18.746776openalex-snapshot
Entropy bounds for constrained two-dimensional random fields
inferredcites →https://doi.org/10.1109/2.55471openalex-snapshot
Fundamentals of bar code information theory
inferredcites →https://doi.org/10.1109/26.681399openalex-snapshot
Two-dimensional low-pass filtering codes
inferredcites →https://doi.org/10.1109/49.124467openalex-snapshot
Finite-state modulation codes for data storage
inferredcites →https://doi.org/10.1109/isit.1993.748322openalex-snapshot
Design of some new Balanced Codes
inferredcites →https://doi.org/10.1109/isit.1998.708702openalex-snapshot
On the redundancy of two-dimensional balanced codes
inferredcites →https://doi.org/10.1126/science.265.5173.749openalex-snapshot
Volume Holographic Storage and Retrieval of Digital Data
inferredcites →https://doi.org/10.1137/s089548019528993xopenalex-snapshot
The Number of Independent Sets in a Grid Graph
inferredcites →https://doi.org/10.1364/ao.29.002038openalex-snapshot
Optical memory disks in optical information processing
inferredcites →https://doi.org/10.1364/josaa.12.002432openalex-snapshot
Channel codes for digital holographic data storage
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1088/0957-4484/20/42/425204openalex-snapshot
Writing to and reading from a nano-scale crossbar memory based on memristors
inferred← citeshttps://doi.org/10.1109/18.771152openalex-snapshot
On the capacity of two-dimensional run-length constrained channels
inferred← citeshttps://doi.org/10.1109/18.850669openalex-snapshot
Two-dimensional weight-constrained codes through enumeration bounds
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/isit.1998.708702openalex-snapshot
On the redundancy of two-dimensional balanced codes
inferred← citeshttps://doi.org/10.1109/isit.2000.866606openalex-snapshot
Two-dimensional codes for second order spectral null constraints
inferred← citeshttps://doi.org/10.1109/isit.2001.935926openalex-snapshot
Enumerative aspects and asymptotics of uniform nonlinear binary arrays
inferred← citeshttps://doi.org/10.1109/isit.2004.1365228openalex-snapshot
Encoding algorithms for 2 dimensional run-length-limited constraints
inferred← citeshttps://doi.org/10.1109/isit.2007.4557382openalex-snapshot
Representation of 2 Dimensional RLL Constraints
inferred← citeshttps://doi.org/10.1109/isit.2011.6033792openalex-snapshot
Low complexity two-dimensional weight-constrained codes
inferred← citeshttps://doi.org/10.1109/isit.2011.6034138openalex-snapshot
Constant weight codes: An approach based on Knuth's balancing method
inferred← citeshttps://doi.org/10.1109/isit.2013.6620206openalex-snapshot
Hamming-weight constrained coded arrays based on covering codes
inferred← citeshttps://doi.org/10.1109/isit.2019.8849737openalex-snapshot
Clustering-Correcting Codes
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517970openalex-snapshot
Efficient Design of Capacity-Approaching Two-Dimensional Weight-Constrained Codes
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834724openalex-snapshot
Using One Redundant Bit to Construct Two-Dimensional Almost-Balanced Codes
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195251openalex-snapshot
A Single-Bit Redundancy Framework for Multi-Dimensional Parametric Constraints
inferred← citeshttps://doi.org/10.1109/itnw.1999.814340openalex-snapshot
Constrained codes and systems
inferred← citeshttps://doi.org/10.1109/itw.2001.955147openalex-snapshot
Three directional spectral null constraints for two-dimensional storage devices
inferred← citeshttps://doi.org/10.1109/itw2.2006.323824openalex-snapshot
Encoding Algorithms for 2 Dimensional Weak Run-Length-Limited Constraints
inferred← citeshttps://doi.org/10.1109/itw62417.2025.11240270openalex-snapshot
From One-Dimensional Codes to Two-Dimensional Codes: A Universal Framework for the Bounded-Weight Constraint
inferred← citeshttps://doi.org/10.1109/jsac.2010.100209openalex-snapshot
Construction of Maximum Run-Length Limited Codes Using Sequence Replacement Techniques
inferred← citeshttps://doi.org/10.1109/jsac.2014.140511openalex-snapshot
Constant Weight Codes: An Approach Based on Knuth's Balancing Method
inferred← citeshttps://doi.org/10.1109/lcomm.2021.3050159openalex-snapshot
Two-Dimensional Weight-Constrained Codes for Crossbar Resistive Memory Arrays
inferred← citeshttps://doi.org/10.1109/mcom.002.2200249openalex-snapshot
Innovation in Constrained Codes
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.2004.826633openalex-snapshot
Improved Bit-Stuffing Bounds on Two-Dimensional Constraints
inferred← citeshttps://doi.org/10.1109/tit.2004.838112openalex-snapshot
Bit-Stuffing Algorithms and Analysis for Run-Length Constrained Channels in Two and Three Dimensions
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.2012.2190380openalex-snapshot
Low Complexity Two-Dimensional Weight-Constrained Codes
inferred← citeshttps://doi.org/10.1109/tit.2023.3244979openalex-snapshot
Two-Dimensional RC/SW Constrained Codes: Bounded Weight and Almost Balanced Weight
inferred← citeshttps://doi.org/10.1109/tit.2023.3288291openalex-snapshot
The Zero Cubes Free and Cubes Unique Multidimensional Constraints
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
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.7840/kics.2013.38a.8.656openalex-snapshot
Integer Programming Model and Heuristic on the Guided Scrambling Encoding for Holographic Data Storage
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.