On the public citation graph
Optimal Interleaving on Tori
0 signed · 43 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.1006/eujc.1998.0211openalex-snapshot
On the Non-existence of 3-Dimensional Tiling in the Lee Metric
inferredcites →https://doi.org/10.1007/3-540-44828-4_23openalex-snapshot
Optimal 2-Dimensional 3-Dispersion Lattices
inferredcites →https://doi.org/10.1016/0166-218x(80)90047-5openalex-snapshot
A note on perfect Lee-codes
inferredcites →https://doi.org/10.1016/0166-218x(81)90018-4openalex-snapshot
Comment on “A note on perfect lee-codes”
inferredcites →https://doi.org/10.1016/0166-218x(81)90030-5openalex-snapshot
A note on perfect Lee-codes over small alphabets
inferredcites →https://doi.org/10.1016/0166-218x(82)90043-9openalex-snapshot
A note on perfect Lee-codes over small alphabets
inferredcites →https://doi.org/10.1016/j.disc.2009.01.020openalex-snapshot
Interleaving schemes on circulant graphs with two offsets
inferredcites →https://doi.org/10.1016/s0743-7315(03)00122-9openalex-snapshot
On resource placements in 3D tori
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1017/cbo9780511606267openalex-snapshot
The Theory of Information and Coding
inferredcites →https://doi.org/10.1023/a:1005106901394openalex-snapshot
Variations on Tilings in the Manhattan Metric
inferredcites →https://doi.org/10.1109/12.628393openalex-snapshot
Resource placement in torus-based networks
inferredcites →https://doi.org/10.1109/18.661516openalex-snapshot
Interleaving schemes for multidimensional cluster errors
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.1994.395119openalex-snapshot
Correcting two-dimensional clusters by interleaving of symbols
inferredcites →https://doi.org/10.1109/isit.1994.395120openalex-snapshot
Two-dimensional interleaving using the set partitioning technique
inferredcites →https://doi.org/10.1109/isit.1997.613362openalex-snapshot
Achieving the Reiger bound for burst errors using two-dimensional interleaving schemes
inferredcites →https://doi.org/10.1109/isit.2002.1023390openalex-snapshot
Three-dimensional cluster error-correcting array codes
inferredcites →https://doi.org/10.1109/isit.2004.1365058openalex-snapshot
On the optimality of coloring with a lattice
inferredcites →https://doi.org/10.1109/isit.2004.1365059openalex-snapshot
Optimal interleaving schemes for correcting 2-D cluster errors
inferredcites →https://doi.org/10.1109/tit.1964.1053680openalex-snapshot
Rook domains, Latin squares, affine planes, and error-distributing codes
inferredcites →https://doi.org/10.1109/tit.1982.1056443openalex-snapshot
An Elias-type bound for Lee codes over large alphabets and its application to perfect codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.2003.811922openalex-snapshot
Quasi-perfect Lee distance codes
inferredcites →https://doi.org/10.1109/tit.2004.840893openalex-snapshot
Multicluster Interleaving on Paths and Cycles
inferredcites →https://doi.org/10.1137/0118025openalex-snapshot
Perfect Codes in the Lee Metric and the Packing of Polyominoes
inferredcites →https://doi.org/10.1145/1063786.1063788openalex-snapshot
Network file storage with graceful performance degradation
inferredcites →https://doi.org/10.5555/62972.63015openalex-snapshot
iWarp: an integrated solution to high-speed parallel computing
inferredcites →https://doi.org/10.5555/789083.1022698openalex-snapshot
Ambient Intelligence Visions and Achievements: Linking Abstract Ideas to Real-World Concepts
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/dac.3013openalex-snapshot
Improving reliability of erasure codes‐based storage paradigm under correlated failures for wireless sensor networks
inferred← citeshttps://doi.org/10.1002/net.21655openalex-snapshot
Region‐based fault‐tolerant distributed file storage system design in networks
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.1109/iccd.2008.4751863openalex-snapshot
In-field NoC-based SoC testing with distributed test vector storage
inferred← citeshttps://doi.org/10.1109/iccd.2009.5413156openalex-snapshot
A distributed concurrent on-line test scheduling protocol for many-core NoC-based systems
inferred← citeshttps://doi.org/10.1109/isit.2004.1365060openalex-snapshot
Optimal t-interleaving on tori
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.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
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.