On the public citation graph
On write-unidirectional memory codes
0 signed · 44 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/j.1538-7305.1984.tb00115.xopenalex-snapshot
Coding for a Write-Once Memory
inferredcites →https://doi.org/10.1007/978-94-010-1826-5_11openalex-snapshot
Extremal Problems for Hypergraphs
inferredcites →https://doi.org/10.1007/bf01896826openalex-snapshot
Continuous versions of some extremal hypergraph problems. II
inferredcites →https://doi.org/10.1016/s0019-9958(82)90344-8openalex-snapshot
How to reuse a “write-once≓ memory
inferredcites →https://doi.org/10.1080/09747338.1997.11415666openalex-snapshot
Personal Communication
inferredcites →https://doi.org/10.1090/chel/361openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1109/tit.1986.1057221openalex-snapshot
Linear binary code for write-once memories (Corresp.)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-54195-0_34openalex-snapshot
Covering radius and writing on memories
inferred← citeshttps://doi.org/10.1007/3-540-54522-0_105openalex-snapshot
Error-correction for WIMs and WUMs
inferred← citeshttps://doi.org/10.1007/978-3-7091-2838-1_9openalex-snapshot
W*M’s: A Survey Writing on Some Binary Memories with Constraints
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90129-5openalex-snapshot
On the optimal structure of recovering set pairs in lattices: the sandglass conjecture
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90276-gopenalex-snapshot
Coding for write-unidirectional memories and conflict resolution
inferred← citeshttps://doi.org/10.1016/0195-6698(95)90031-4openalex-snapshot
Cancellative pairs of families of sets
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90048-5openalex-snapshot
Coding for write-efficient memory
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80131-3openalex-snapshot
Some Results on the Sandglass Conjecture
inferred← citeshttps://doi.org/10.1109/18.335880openalex-snapshot
On multiuser write-efficient memories
inferred← citeshttps://doi.org/10.1109/18.340461openalex-snapshot
On the general defective channel with informed encoder and capacities of some constrained memories
inferred← citeshttps://doi.org/10.1109/18.746827openalex-snapshot
On the capacity of generalized write-once memory with state transitions described by an arbitrary directed acyclic graph
inferred← citeshttps://doi.org/10.1109/18.79954openalex-snapshot
The four cases of write unidirectional memory codes over arbitrary alphabets (optical storage)
inferred← citeshttps://doi.org/10.1109/18.87005openalex-snapshot
Reuseable memories in the light of the old arbitrarily varying and a new outputwise varying channel theory
inferred← citeshttps://doi.org/10.1109/18.887845openalex-snapshot
On the capacity and error-correcting codes of write-efficient memories
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797723openalex-snapshot
Designing floating codes for expected performance
inferred← citeshttps://doi.org/10.1109/allerton.2016.7852296openalex-snapshot
When is the zero-error capacity positive in the relay, multiple-access, broadcast and interference channels?
inferred← citeshttps://doi.org/10.1109/isit.1991.695112openalex-snapshot
Outputwise Varying Channels - A General Model For Memories
inferred← citeshttps://doi.org/10.1109/isit.1991.695365openalex-snapshot
The Period-2 Capacity Of Write undirectional memories with uniformed encoder and decoder
inferred← citeshttps://doi.org/10.1109/isit.1997.613138openalex-snapshot
On the capacity region of write-unidirectional memory with nonperiodic codes
inferred← citeshttps://doi.org/10.1109/isit.2009.5205976openalex-snapshot
On the lifetime of multilevel memories
inferred← citeshttps://doi.org/10.1109/isit.2009.5205981openalex-snapshot
Universal rewriting in constrained memories
inferred← citeshttps://doi.org/10.1109/isita.2008.4895391openalex-snapshot
Rewritable storage channels
inferred← citeshttps://doi.org/10.1109/itw.2013.6691281openalex-snapshot
Zero vs. ε error in interference channels
inferred← citeshttps://doi.org/10.1109/pacrim.2009.5291244openalex-snapshot
Information representation and coding for flash memories
inferred← citeshttps://doi.org/10.1109/tit.2004.825047openalex-snapshot
On the Capacity of Write-Unidirectional Memories With Nonperiodic Codes
inferred← citeshttps://doi.org/10.1109/tit.2009.2039040openalex-snapshot
Designing Floating Codes for Expected Performance
inferred← citeshttps://doi.org/10.1109/tit.2010.2059530openalex-snapshot
Rewriting Codes for Joint Information Storage in Flash Memories
inferred← citeshttps://doi.org/10.1109/tit.2011.2134370openalex-snapshot
Position Modulation Code for Rewriting Write-Once Memories
inferred← citeshttps://doi.org/10.1109/tit.2013.2251755openalex-snapshot
Trajectory Codes for Flash Memory
inferred← citeshttps://doi.org/10.1561/0100000084openalex-snapshot
Channel Coding Methods for Non-Volatile Memories
inferred← citeshttps://doi.org/10.1561/9781680831030openalex-snapshot
Channel Coding Methods for Non-Volatile Memories
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.