Fetching the paper…
Reading the bibliography…
In this paper we give an explicit construction of a capacity achieving family of binary t-write WOM codes for any number of writes t, that have a polynomial time encoding and decoding algorithms.
How to reuse a “write-once” memory
R. L. Rivest and A. Shamir · 1982
Earlier work this paper cites.
On the capacity of permanent memory
C. Heegard · 1985
Earlier work this paper cites.
Pseudo-random generation from one-way functions (extended abstracts)
R. Impagliazzo, L. A. Levin, and M. Luby · 1989
Earlier work this paper cites.
On the capacity of generalized write-once memory with state transitions described by an arbitrary directed acyclic graph
F. Fu and A. J. Han Vinck · 1999
Earlier work this paper cites.
Extracting all the randomness and reducing the error in trevisan’s extractors
R. Raz, O. Reingold, and S. P. Vadhan · 2002
Earlier work this paper cites.
Recent developments in extractors
R. Shaltiel · 2002
Earlier work this paper cites.
How to get more mileage from randomness extractors
R. Shaltiel · 2008
Cited alongside, same era.
Extractors for a constant number of polynomially small min-entropy independent sources
Anup Rao · 2009
Cited alongside, same era.
Polar codes are optimal for lossy source coding
S. B. Korada and R. L. Urbanke · 2010
Cited alongside, same era.
Multiple-write wom-codes
S. Kayser, E. Yaakobi, P. H. Siegel, A. Vardy, and J. K. Wolf · 2010
Cited alongside, same era.
Low complexity codes for writing a write-once memory twice
Y. Wu · 2010
Cited alongside, same era.
Efficient two-write wom-codes
E. Yaakobi, S. Kayser, P. H. Siegel, A. Vardy, and J. K. Wolf · 2010
Cited alongside, same era.
Non-binary wom-codes for multilevel flash memories
R. Gabrys, E. Yaakobi, L. Dolecek, P. H. Siegel, A. Vardy, and J. K. Wolf · 2011
Later among the works it cites.
Polar write once memory codes
D. Burshtein and A. Strugatski · 2012
Closest in time.
Invertible zero-error dispersers and defective memory with stuck-at errors
A. Gabizon and R. Shaltiel · 2012
Closest in time.
Capacity achieving two-write wom codes
A. Shpilka · 2012
Closest in time.
High sum-rate three-write and non-binary wom codes
E. Yaakobi and A. Shpilka · 2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…