On the public citation graph

The capacity and coding gain of certain checkerboard codes

0 signed · 107 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-4612-1136-5openalex-snapshot
Linear Algebra
inferredcites →https://doi.org/10.1007/978-1-4757-3069-2openalex-snapshot
Advanced mathematical methods for scientists and engineers
inferredcites →https://doi.org/10.1017/9781108899727openalex-snapshot
An Introduction to Symbolic Dynamics and Coding
inferredcites →https://doi.org/10.1088/0031-9112/8/3/005openalex-snapshot
Principles and Techniques of Applied Mathematics
inferredcites →https://doi.org/10.1109/18.567731openalex-snapshot
Cascading methods for runlength-limited arrays
inferredcites →https://doi.org/10.1109/18.661518openalex-snapshot
Shannon capacity of M-ary redundant multitrack runlength limited codes
inferredcites →https://doi.org/10.1109/20.179818openalex-snapshot
A new class of two-dimensional RLL recording codes
inferredcites →https://doi.org/10.1109/isit.1995.535762openalex-snapshot
On the capacity rates of two-dimensional runlength limited codes
inferredcites →https://doi.org/10.1119/1.1934401openalex-snapshot
Principles and Techniques of Applied Mathematics
inferredcites →https://doi.org/10.1137/s089548019528993xopenalex-snapshot
The Number of Independent Sets in a Grid Graph

What points at this work

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

inferred← citeshttps://doi.org/10.1002/0471219282.eot341openalex-snapshot
Constrained Coding Techniques for Data Storage
inferred← citeshttps://doi.org/10.1007/3-540-46796-3_24openalex-snapshot
Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel
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.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.1016/j.dam.2003.02.001openalex-snapshot
New upper and lower bounds on the channel capacity of read/write isolated memory
inferred← citeshttps://doi.org/10.1016/j.disc.2018.11.014openalex-snapshot
The transfer matrices and the capacity of the 2-dimensional (1,∞) -runlength limited constraint
inferred← citeshttps://doi.org/10.1109/18.720539openalex-snapshot
Codes for digital recorders
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.841179openalex-snapshot
Capacity bounds for the three-dimensional (0,1) run length limited channel
inferred← citeshttps://doi.org/10.1109/18.850669openalex-snapshot
Two-dimensional weight-constrained codes through enumeration bounds
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/18.995538openalex-snapshot
Parallel constrained coding with application to two-dimensional constraints
inferred← citeshttps://doi.org/10.1109/glocom.2003.1258962openalex-snapshot
Signal processing and coding for two-dimensional optical storage
inferred← citeshttps://doi.org/10.1109/glocom.2011.6134474openalex-snapshot
Time-Space Constrained Codes for Phase-Change Memories
inferred← citeshttps://doi.org/10.1109/icc.2006.254921openalex-snapshot
The Depth-First Algorithm for Designing 2-D Single-State Block Codes
inferred← citeshttps://doi.org/10.1109/icc.2006.255293openalex-snapshot
V-Shaped Viterbi Symbol Detection for Multilevel 2D Optical Storage
inferred← citeshttps://doi.org/10.1109/icc.2014.6883928openalex-snapshot
Constrained coding and detection for TDMR using generalized belief propagation
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.708927openalex-snapshot
The capacity and coding gain of certain checkerboard codes
inferred← citeshttps://doi.org/10.1109/isit.2000.866475openalex-snapshot
Asymptotic capacity of the two-dimensional square constraint
inferred← citeshttps://doi.org/10.1109/isit.2000.866578openalex-snapshot
New upper and lower bounds on the channel capacity of read/write isolated memory
inferred← citeshttps://doi.org/10.1109/isit.2000.866605openalex-snapshot
Efficient coding schemes for the hard-square model
inferred← citeshttps://doi.org/10.1109/isit.2001.935927openalex-snapshot
The capacity of some hexagonal (d,k)-constraints
inferred← citeshttps://doi.org/10.1109/isit.2001.936132openalex-snapshot
Zero/positive capacities of two-dimensional runlength constrained arrays
inferred← citeshttps://doi.org/10.1109/isit.2002.1023626openalex-snapshot
Algebraic and combinatorial properties of the transfer matrix of the 2-dimensional (1, ∞) runlength limited constraint
inferred← citeshttps://doi.org/10.1109/isit.2002.1023657openalex-snapshot
Improved bit-stuffing bounds on two-dimensional constraints
inferred← citeshttps://doi.org/10.1109/isit.2003.1228088openalex-snapshot
Asymptotic capacity of two-dimensional channels with checkerboard constraints
inferred← citeshttps://doi.org/10.1109/isit.2004.1365196openalex-snapshot
Capacity bounds for the hard-triangle model
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.1365228openalex-snapshot
Encoding algorithms for 2 dimensional run-length-limited constraints
inferred← citeshttps://doi.org/10.1109/isit.2005.1523589openalex-snapshot
Two-dimensional bit-stuffing schemes with multiple transformers
inferred← citeshttps://doi.org/10.1109/isit.2006.261953openalex-snapshot
Error Event Characterization on 2-D ISI Channels
inferred← citeshttps://doi.org/10.1109/isit.2006.261995openalex-snapshot
Automated Theorem Proving for Hexagonal Run Length Constrained Capacity Computation
inferred← citeshttps://doi.org/10.1109/isit.2006.261996openalex-snapshot
On Row-by-Row Coding for 2-D Constraints
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.262111openalex-snapshot
The Positive Capacity Region of Two-Dimensional Run Length Constrained Channels
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.2007.4557382openalex-snapshot
Representation of 2 Dimensional RLL Constraints
inferred← citeshttps://doi.org/10.1109/isit.2007.4557463openalex-snapshot
Capacity Lower Bounds and Approximate Enumerative Coding for 2-D Constraints
inferred← citeshttps://doi.org/10.1109/isit.2008.4595231openalex-snapshot
Two-dimensional constrained coding based on tiling
inferred← citeshttps://doi.org/10.1109/isit.2009.5206053openalex-snapshot
Concave programming upper bounds on the capacity of 2-D constraints
inferred← citeshttps://doi.org/10.1109/isit.2009.5206056openalex-snapshot
Improved lower bounds on capacities of symmetric 2-dimensional constraints ising Rayleigh quotients
inferred← citeshttps://doi.org/10.1109/isit.2010.5513231openalex-snapshot
Generalized belief propagation algorithm for the capacity of multi-dimensional run-length limited constraints
inferred← citeshttps://doi.org/10.1109/isit.2014.6874995openalex-snapshot
Approximate capacities of two-dimensional codes by spatial mixing
inferred← citeshttps://doi.org/10.1109/isit.2018.8437899openalex-snapshot
On the Capacity of 2-Dimensional Channels
inferred← citeshttps://doi.org/10.1109/isita.2008.4895599openalex-snapshot
Constraints for two-dimensional recording media
inferred← citeshttps://doi.org/10.1109/isita.2008.4895600openalex-snapshot
Consideration on two dimensional constraint codes with honeycomb structure
inferred← citeshttps://doi.org/10.1109/itnw.1999.814340openalex-snapshot
Constrained codes and systems
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/itw.2009.5351455openalex-snapshot
Estimating the partition function of 2-D fields and the capacity of constrained noiseless 2-D channels using tree-based Gibbs sampling
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/jproc.2018.2795961openalex-snapshot
Signal Processing and Coding Techniques for 2-D Magnetic Recording: An Overview
inferred← citeshttps://doi.org/10.1109/jsac.2014.140504openalex-snapshot
Constrained Codes that Mitigate Inter-Cell Interference in Read/Write Cycles for Flash Memories
inferred← citeshttps://doi.org/10.1109/mbits.2023.3336213openalex-snapshot
Channels Engineering in Magnetic Recording: From Theory to Practice
inferred← citeshttps://doi.org/10.1109/tc.2015.2409862openalex-snapshot
Bit-Stuffing Algorithms for Crosstalk Avoidance in High-Speed Switching
inferred← citeshttps://doi.org/10.1109/tcomm.2012.122211.110026openalex-snapshot
Generalized Belief Propagation for the Noiseless Capacity and Information Rates of Run-Length Limited Constraints
inferred← citeshttps://doi.org/10.1109/tip.2002.801127openalex-snapshot
A joint estimation approach for two-tone image deblurring by blind deconvolution
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.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.847726openalex-snapshot
Two-Dimensional Cluster-Correcting Codes
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.2006.883544openalex-snapshot
The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels
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.2008.920325openalex-snapshot
A Class of Two-Dimensional Cluster-Correcting Codes Based on Schwartz–Etzion's Construction Methods
inferred← citeshttps://doi.org/10.1109/tit.2009.2023754openalex-snapshot
On Row-by-Row Coding for 2-D Constraints
inferred← citeshttps://doi.org/10.1109/tit.2009.2027505openalex-snapshot
Block Pickard Models for Two-Dimensional Constraints
inferred← citeshttps://doi.org/10.1109/tit.2010.2040864openalex-snapshot
Two-Dimensional Constrained Coding Based on Tiling
inferred← citeshttps://doi.org/10.1109/tit.2010.2040942openalex-snapshot
Improved Lower Bounds on Capacities of Symmetric 2D Constraints Using Rayleigh Quotients
inferred← citeshttps://doi.org/10.1109/tit.2010.2090234openalex-snapshot
Convex Programming Upper Bounds on the Capacity of 2-D Constraints
inferred← citeshttps://doi.org/10.1109/tit.2011.2119464openalex-snapshot
New Bounds on the Capacity of Multidimensional Run-Length Constraints
inferred← citeshttps://doi.org/10.1109/tit.2012.2212413openalex-snapshot
Monte Carlo Algorithms for the Partition Function and Information Rates of Two-Dimensional Channels
inferred← citeshttps://doi.org/10.1109/tit.2013.2257916openalex-snapshot
Time–Space Constrained Codes for Phase-Change Memories
inferred← citeshttps://doi.org/10.1109/tit.2014.2321554openalex-snapshot
Accurate Lower Bounds on 2-D Constraint Capacities From Corner Transfer Matrices
inferred← citeshttps://doi.org/10.1109/tit.2021.3120088openalex-snapshot
Hexagonal Run-Length Zero Capacity Region—Part II: Automated Proofs
inferred← citeshttps://doi.org/10.1109/tit.2021.3120090openalex-snapshot
Hexagonal Run-Length Zero Capacity Region—Part I: Analytical Proofs
inferred← citeshttps://doi.org/10.1109/tmag.2006.888067openalex-snapshot
Sequence Detection Based on a Variable State Trellis for Multidimensional ISI Channels
inferred← citeshttps://doi.org/10.1109/tmag.2007.897665openalex-snapshot
Refinements of Multi-Track Viterbi Bit-Detection
inferred← citeshttps://doi.org/10.1117/1.2087647openalex-snapshot
Low complexity symbol detection method for multilevel 2-D optical storage based on a linear channel model
inferred← citeshttps://doi.org/10.1137/s0895480102419767openalex-snapshot
Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints
inferred← citeshttps://doi.org/10.1145/2846091openalex-snapshot
Coding Rate Analysis of Forbidden Overlap Codes in High-Speed Buses
inferred← citeshttps://doi.org/10.1364/ao.42.006525openalex-snapshot
Nonlinear signal-processing model for scalar diffraction in optical recording
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.32657/10356/73918openalex-snapshot
Constrained codes for intercell interference mitigation and dynamic thresholding in flash memories
inferred← citeshttps://doi.org/10.3934/dcds.2008.20.725openalex-snapshot
Symbolic dynamics on free groups
inferred← citeshttps://doi.org/10.48550/arxiv.0808.0596openalex-snapshot
On row-by-row coding for 2-D constraints
inferred← citeshttps://doi.org/10.48550/arxiv.0903.1716openalex-snapshot
Improved Lower Bounds on Capacities of Symmetric 2-Dimensional Constraints using Rayleigh Quotients
inferred← citeshttps://doi.org/10.48550/arxiv.1207.4530openalex-snapshot
Time-Space Constrained Codes for Phase-Change Memories
inferred← citeshttps://doi.org/10.48550/arxiv.1210.5189openalex-snapshot
Accurate lower bounds on two-dimensional constraint capacities from corner transfer matrices
inferred← citeshttps://doi.org/10.6100/ir638352openalex-snapshot
System characterization and reception techniques for two-dimensional optical 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.