Models of multi-user write-efficient memories and general diametric theorems
From MaRDI portal
Publication:1363782
DOI10.1006/INCO.1997.2629zbMath0879.68061OpenAlexW2079053998MaRDI QIDQ1363782
Publication date: 11 August 1997
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8f1bf1517b872b848d240d6d240add9fc774ca12
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An ``average distance inequality for large subsets of the cube
- Coding for write-efficient memory
- Diametric theorems in sequence spaces
- Contributions to the geometry of Hamming spaces
- The diametric theorem in Hamming spaces---optimal anticodes
- The asymptotic behaviour of diameters in the average
- How to reuse a “write-once≓ memory
- Coding for a Write-Once Memory
- Source coding with side information and a converse for degraded broadcast channels
- On multiuser write-efficient memories
- Intersection theorems for systems of finite sets
- On a combinatorial conjecture of Erdös
This page was built for publication: Models of multi-user write-efficient memories and general diametric theorems