Models of multi-user write-efficient memories and general diametric theorems
From MaRDI portal
Recommendations
- On multiuser write-efficient memories
- On the capacity and error-correcting codes of write-efficient memories
- On the Capacity of Write-Constrained Memories
- On the Capacity of Memoryless Rewritable Storage Channels
- On the Capacity of Write-Unidirectional Memories With Nonperiodic Codes
- scientific article; zbMATH DE number 4083535
- scientific article; zbMATH DE number 4113974
- On the capacity of generalized write-once memory with state transitions described by an arbitrary directed acyclic graph
- On the Capacity of Write-Once Memories
- The memory tesseract: mathematical equivalence between composite and separate storage memory models
Cites work
- An ``average distance inequality for large subsets of the cube
- Coding for a Write-Once Memory
- Coding for write-efficient memory
- Contributions to the geometry of Hamming spaces
- Diametric theorems in sequence spaces
- How to reuse a “write-once≓ memory
- scientific article; zbMATH DE number 3140980 (Why is no real title available?)
- scientific article; zbMATH DE number 3908323 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3582057 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- Intersection theorems for systems of finite sets
- On a combinatorial conjecture of Erdös
- On multiuser write-efficient memories
- Source coding with side information and a converse for degraded broadcast channels
- The asymptotic behaviour of diameters in the average
- The diametric theorem in Hamming spaces---optimal anticodes
Cited in
(3)
This page was built for publication: Models of multi-user write-efficient memories and general diametric theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363782)
