Fetching the paper…
Reading the bibliography…
In this paper we give several new constructions of WOM codes.
Threshold decoding
J. L. Massey · 1963
Earlier work this paper cites.
An estimate of the complexity of constructing binary linear cascade codes
V. V. Zyablov · 1971
Earlier work this paper cites.
A class of constructive asymptotically good algebraic codes
J. Justesen · 1972
Earlier work this paper cites.
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.
Linear binary code for writeonce memories
G.D. Cohen, P. Godlewski, and F. Merkx · 1986
Cited alongside, same era.
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
Cited alongside, same era.
Extractors and pseudorandom generators
L. Trevisan · 2001
Cited alongside, same era.
Extracting all the randomness and reducing the error in trevisan’s extractors
R. Raz, O. Reingold, and S. P. Vadhan · 2002
Cited alongside, same era.
Randomness Extractors for Independent Sources and Applications
A. Rao · 2007
Cited alongside, same era.
Extractors for low-weight affine sources
A. Rao · 2009
Later among the works it cites.
Multiple-write wom-codes
S. Kayser, E. Yaakobi, P. H. Siegel, A. Vardy, and J. K. Wolf · 2010
Later among the works it cites.
Low complexity codes for writing a write-once memory twice
Y. Wu · 2010
Later among the works it cites.
Efficient two-write wom-codes
E. Yaakobi, S. Kayser, P. H. Siegel, A. Vardy, and J. K. Wolf · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…