On the public citation graph
Two-dimensional interleaving schemes with repetitions: constructions and bounds
0 signed · 63 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/(sici)1097-0037(199903)33:2<125::aid-net4>3.0.co;2-sopenalex-snapshot
Rectilinear full Steiner tree generation
inferredcites →https://doi.org/10.1007/978-1-4757-2016-7openalex-snapshot
Sphere Packings, Lattices and Groups
inferredcites →https://doi.org/10.1007/978-1-4757-3171-2_6openalex-snapshot
Exact Algorithms for Plane Steiner Tree Problems: A Computational Study
inferredcites →https://doi.org/10.1016/0097-3165(78)90015-8openalex-snapshot
Bilinear forms over a finite field, with applications to coding theory
inferredcites →https://doi.org/10.1016/s0019-9958(77)90232-7openalex-snapshot
A theory of two-dimensional cyclic codes
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1023/a:1009758919736openalex-snapshot
New Approximation Algorithms for the Steiner Tree Problems
inferredcites →https://doi.org/10.1049/el:19941204openalex-snapshot
Array codes for cluster-error correction
inferredcites →https://doi.org/10.1109/18.6029openalex-snapshot
Two-dimensional burst identification codes and their use in burst correction
inferredcites →https://doi.org/10.1109/18.661516openalex-snapshot
Interleaving schemes for multidimensional cluster errors
inferredcites →https://doi.org/10.1109/18.75248openalex-snapshot
Maximum-rank array codes and their application to crisscross error correction
inferredcites →https://doi.org/10.1109/18.978765openalex-snapshot
Two-dimensional interleaving schemes with repetitions: constructions and bounds
inferredcites →https://doi.org/10.1109/isit.1997.613272openalex-snapshot
Two-dimensional interleaving schemes with repetitions
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/0132071openalex-snapshot
The Rectilinear Steiner Tree Problem is $NP$-Complete
inferredcites →https://doi.org/10.1364/josaa.9.001978openalex-snapshot
Cross-talk-limited storage capacity of volume holographic memory
inferredcites →https://doi.org/10.1364/ol.19.001483openalex-snapshot
Error correction for increasing the usable capacity of photorefractive memories
inferredcites →https://doi.org/10.2307/2323992openalex-snapshot
Sphere Packings, Lattices and Groups.
inferredcites →https://doi.org/10.7936/k7mc8xcropenalex-snapshot
New Approximation Algorithms for the Steiner Tree Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11839569_15openalex-snapshot
Autonomic K-Interleaving Construction Scheme for P2P Overlay Networks
inferred← citeshttps://doi.org/10.1007/3-540-44828-4_23openalex-snapshot
Optimal 2-Dimensional 3-Dispersion Lattices
inferred← citeshttps://doi.org/10.1007/s10623-025-01726-5openalex-snapshot
Constructions of covering sequences and 2D-sequences
inferred← citeshttps://doi.org/10.1007/s11045-010-0134-zopenalex-snapshot
Basis arrays and successive packing for M-D interleaving
inferred← citeshttps://doi.org/10.1007/s12200-014-0458-7openalex-snapshot
Recent advances in holographic data storage
inferred← citeshttps://doi.org/10.1016/b978-0-44-313517-0.00016-0openalex-snapshot
Two-dimensional applications
inferred← citeshttps://doi.org/10.1016/j.dam.2006.11.009openalex-snapshot
Optimal interleaving schemes for correcting two-dimensional cluster errors
inferred← citeshttps://doi.org/10.1016/j.disc.2009.01.020openalex-snapshot
Interleaving schemes on circulant graphs with two offsets
inferred← citeshttps://doi.org/10.1016/j.disc.2014.02.019openalex-snapshot
Existence of a folding in multidimensional coding
inferred← citeshttps://doi.org/10.1016/j.jcta.2005.01.012openalex-snapshot
Optimal tristance anticodes in certain graphs
inferred← citeshttps://doi.org/10.1049/el:20020676openalex-snapshot
Two-dimensional interleaving with burst error-correcting codes
inferred← citeshttps://doi.org/10.1109/chinacom.2011.6158283openalex-snapshot
Performance analysis of multiple antenna systems within different techniques
inferred← citeshttps://doi.org/10.1109/dmamh.2007.7openalex-snapshot
Research on Forbidden Zone of Virtual Human in Distributed Virtual Environment
inferred← citeshttps://doi.org/10.1109/dmamh.2007.72openalex-snapshot
A New Interleaving Algorithm of Optical-Storage System
inferred← citeshttps://doi.org/10.1109/icecs.2006.379822openalex-snapshot
A Robust Blind Image Watermarking Scheme in the SPIHT-Compressed Bit-Stream
inferred← citeshttps://doi.org/10.1109/isit.2004.1365058openalex-snapshot
On the optimality of coloring with a lattice
inferred← citeshttps://doi.org/10.1109/isit.2004.1365059openalex-snapshot
Optimal interleaving schemes for correcting 2-D cluster errors
inferred← citeshttps://doi.org/10.1109/isit.2004.1365060openalex-snapshot
Optimal t-interleaving on tori
inferred← citeshttps://doi.org/10.1109/isit.2004.1365196openalex-snapshot
Capacity bounds for the hard-triangle model
inferred← citeshttps://doi.org/10.1109/isit.2007.4557415openalex-snapshot
Error-Correction of Multidimensional Bursts
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195674openalex-snapshot
Hierarchy of Pseudo-Random Array Codes
inferred← citeshttps://doi.org/10.1109/isita.2008.4895611openalex-snapshot
Robust adaptive coding schemes for multipath fading channels
inferred← citeshttps://doi.org/10.1109/itre.2003.1270576openalex-snapshot
Optimal 2-D interleaving for robust multimedia transmission
inferred← citeshttps://doi.org/10.1109/jsait.2023.3338326openalex-snapshot
Dimensions of Channel Coding: From Theory to Algorithms to Applications
inferred← citeshttps://doi.org/10.1109/mcas.2004.1286985openalex-snapshot
Interleaving for combating bursts of errors
inferred← citeshttps://doi.org/10.1109/tcomm.2015.2438869openalex-snapshot
Two-Dimensional Error-Pattern-Correcting Codes
inferred← citeshttps://doi.org/10.1109/tit.2004.840893openalex-snapshot
Multicluster Interleaving on Paths and Cycles
inferred← citeshttps://doi.org/10.1109/tit.2004.842739openalex-snapshot
Optimal 2-D Interleaving With Latin Rectangles
inferred← citeshttps://doi.org/10.1109/tit.2004.842779openalex-snapshot
On the Covering Radii of Binary Reed–Muller Codes in the Set of Resilient Boolean Functions
inferred← citeshttps://doi.org/10.1109/tit.2005.847726openalex-snapshot
Two-Dimensional Cluster-Correcting Codes
inferred← citeshttps://doi.org/10.1109/tit.2006.880071openalex-snapshot
Optimal Interleaving Schemes for Two-Dimensional 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.2008.2011520openalex-snapshot
Error-Correction of Multidimensional Bursts
inferred← citeshttps://doi.org/10.1109/tit.2008.928286openalex-snapshot
Two-Dimensional Array Coloring With Many Colors
inferred← citeshttps://doi.org/10.1109/tit.2011.2146010openalex-snapshot
Sequence Folding, Lattice Tiling, and Multidimensional Coding
inferred← citeshttps://doi.org/10.1109/tit.2024.3518434openalex-snapshot
On de Bruijn Array Codes—Part I: Nonlinear Codes
inferred← citeshttps://doi.org/10.1109/tit.2026.3686267openalex-snapshot
On de Bruijn Array Codes—Part II: Pseudo-Random Array Codes
inferred← citeshttps://doi.org/10.1137/s0895480104439589openalex-snapshot
On the Optimality of Coloring with a Lattice
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.3745/jips.2008.4.2.053openalex-snapshot
An Autonomic -Interleaving Registry Overlay Network for Efficient Ubiquities Web Services Discovery Service
inferred← citeshttps://doi.org/10.7907/91r7-mh71.openalex-snapshot
Optimized network data storage and topology control
showing the first 42 of 43 · page through all 43
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.