Current Should Not Sneak: Constrained Codes for Reliable Memristor Crossbar Arrays
arXiv:2607.15929
2026
Memory
1 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper develops non-binary constrained codes that eliminate or strongly suppress short rectangular sneak paths in memristor arrays, using GF(4) codes for two simultaneously read rows and GF(8) codes for three. The transferable asset is a constructive, rate-aware representation that enforces local combinatorial constraints on stored symbols while retaining a measurable information rate. A direct ML application is reliable storage of quantized neural-network weights or embeddings in ReRAM: encode blocks before writing, decode after reading, and test whether the reduction in read errors improves model accuracy enough to justify coding overhead. The central engineering trade-off is explicit: inserting a zero row can force S_4=0 but changes the rate to R_new=2R/3.
Ideas from this paper
Unverified
2026
Store quantized neural-network weights in ReRAM using GF(4)- or GF(8)-based constrained blocks rather than writing raw symbols. The encoder selects codewords whose local patterns cannot create the most damaging short rectangular sneak paths, while a decoder reconstructs the original quantized symbols after sensing. This targets persistent edge-model storage and memristor crossbar weight loading, where reducing read errors may be more valuable than the coding-rate loss.
Useful5/10
Difficulty6/10
Novelty8/10