Capacity achieving two-write WOM codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7256 LNCS, Issue , 2012, Pages 631-642

  Shpilka, Amir ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY ALPHABETS; BIT-FIXING SOURCES; ENCODING AND DECODING; EXPLICIT CONSTRUCTIONS; LINEAR CODES; NEW CONSTRUCTIONS;

ARTIFICIAL INTELLIGENCE;

INFORMATION SCIENCE;

EID: 84860811265     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29344-3_53     Document Type: Conference Paper

References (15)

1. Rivest, R.L., Shamir, A.: How to reuse a "write-once" memory. Information and Control 55(1-3), 1-19 (1982)
2. Yaakobi, E., Kayser, S., Siegel, P.H., Vardy, A.,Wolf, J.K.: Efficient two-write womcodes. In: Proceedings of IEEE Information Theory Workshop, Dublin, Ireland (2010)
3. Heegard, C.: On the capacity of permanent memory. IEEE Transactions on Information Theory 31(1), 34-41 (1985)
4. Fu, F., Vinck, A.J.H.: On the capacity of generalized write-once memory with state transitions described by an arbitrary directed acyclic graph. IEEE Transactions on Information Theory 45(1), 308-313 (1999)
5. Shpilka, A.: New constructions of WOM codes using the Wozencraft ensemble. CoRR abs/1110.6590 (2011)
6. Kayser, S., Yaakobi, E., Siegel, P.H., Vardy, A., Wolf, J.K.: Multiple-write womcodes. In: Proceedings of the 48th Annual Allerton Conference on Communication, Control and Computing (2010)
7. Cohen, G., Godlewski, P., Merkx, F.: Linear binary code for writeonce memories. IEEE Transactions on Information Theory 32(5), 697-700 (1986)
8. Wu, Y.: Low complexity codes for writing a write-once memory twice. In: Proceedings of IEEE International Symposium on Information Theory, pp. 1928-1932 (2010)
9. Massey, J.L.: Threshold decoding. Technical Report 410, Massachusetts Institute of Technology, Research Laboratory of Electronics, Cambridge, MA (1963)
10. Justesen, J.: A class of constructive asymptotically good algebraic codes. IEEE Transactions on Information Theory 18, 652-656 (1972)
11. Zyablov, V.V.: An estimate of the complexity of constructing binary linear cascade codes. Probl. Peredachi Inf. 7(1), 5-13 (1971)
12. Rao, A.: Randomness Extractors for Independent Sources and Applications. PhD thesis, U. T. Austin (2007)
13. Raz, R., Reingold, O., Vadhan, S.P.: Extracting all the randomness and reducing the error in trevisan's extractors. J. Comput. Syst. Sci. 65(1), 97-128 (2002)
14. Trevisan, L.: Extractors and pseudorandom generators. J. ACM 48(4), 860-879 (2001)
15. Rao, A.: Extractors for low-weight affine sources. In: Proceedings of the 24th Annual CCC, pp. 95-101 (2009)