New constructions of WOM codes using the wozencraft ensemble

IEEE Transactions on Information Theory

Volumn 59, Issue 7, 2013, Pages 4520-4529

  Shpilka, Amir ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Coding theory; Extractors; Flash memories; Memories with defect; Wozencraft ensemble; Write once memory (WOM) codes

Indexed keywords

COMPUTER PROGRAMMING; DECODING; DEFECTS; FLASH MEMORY; POLYNOMIAL APPROXIMATION;

BIT-FIXING SOURCES; CODING THEORY; ENCODING AND DECODING; EXPLICIT CONSTRUCTIONS; EXTRACTORS; NEW CONSTRUCTIONS; WOZENCRAFT ENSEMBLE; WRITE-ONCE-MEMORY (WOM) CODES;

ENCODING (SYMBOLS);

EID: 84897585040     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2013.2251455     Document Type: Article

References (19)

1. A. Shpilka, "Capacity achieving two-write WOM codes," in Proc. LATIN, 2012, pp. 631-642.
2. R. L. Rivest and A. Shamir, "How to reuse a 'write-once' memory," Inf. Control, vol. 55, no. 1-3, pp. 1-19, 1982.
3. E. Yaakobi, S. Kayser, P.H. Siegel, A. Vardy, and J.K. Wolf, "Efficient two-write WOM-codes," presented at the IEEE Inf. TheoryWorkshop, Dublin, Ireland, 2010.
4. C. Heegard, "On the capacity of permanent memory," IEEE Trans. Inf. Theory, vol. IT-31, no. 1, pp. 34-41, Jan. 1985.
5. F. Fu and A. J. H. Vinck, "On the capacity of generalized write-once memory with state transitions described by an arbitrary directed acyclic graph," IEEE Trans. Inf. Theory, vol. 45, no. 1, pp. 308-313, Jan. 1999.
6. S. Kayser, E. Yaakobi, P. H. Siegel, A. Vardy, and J. K. Wolf, "Multiple-write WOM-codes," in Proc. 48th Annu. Allerton Conf. Commun., Control Comput., 2010, pp. 1062-1068.
7. G. Cohen, P. Godlewski, and F. Merkx, "Linear binary code for write-once memories," IEEE Trans. Inf. Theory, vol. IT-32, no. 5, pp. 697-700, Sep. 1986. (Pubitemid 17468633)
8. Y. Wu, "Low complexity codes for writing a write-once memory twice," in Proc. IEEE Int. Symp. Inf. Theory, 2010, pp. 1928-1932.
9. E. Yaakobi and A. Shpilka, "High sum-rate three-write and non-binary WOM codes," in Proc. Int. Symp. Inf. Theory, 2012, pp. 1391-1395.
10. D. Burshtein and A. Strugatski, "Polar write once memory codes," in Proc. Int. Symp. Inf. Theory, 2012, pp. 1972-1976.
11. A. Shpilka, "Capacity achieving multiwrite WOM codes," CoRR, vol. ABS/1209.1128, 2012.
12. J. L. Massey, Threshold decoding Res. Lab. Electron., Massachusetts Inst. Technol., Cambridge, MA, USA, Tech. Rep. 410, 1963.
13. J. Justesen, "A class of constructive asymptotically good algebraic codes," IEEE Trans. Inf. Theory, vol. 18, no. 5, pp. 652-656, Sep. 1972.
14. V. V. Zyablov, "An estimate of the complexity of constructing binary linear cascade codes," Probl. Peredachi Inf., vol. 7, no. 1, pp. 5-13, 1971.
15. M. Cheraghchi, "Capacity achieving codes from randomness conductors," in Proc. IEEE Int. Symp. Inf. Theory, 2009, pp. 2639-2643.
16. A. Rao, "Randomness extractors for independent sources and applications," Ph.D. dissertation, Univ. Texas Austin, Austin, USA, 2007.
17. R. Raz, O. Reingold, and S. P. Vadhan, "Extracting all the randomness and reducing the error in Trevisan's extractors," J. Comput. Syst. Sci., vol. 65, no. 1, pp. 97-128, 2002. (Pubitemid 41161760)
18. L. Trevisan, "Extractors and pseudorandom generators," J. ACM, vol. 48, no. 4, pp. 860-879, 2001.
19. A. Rao, "Extractors for a constant number of polynomially small minentropy independent sources," SIAM J. Comput., vol. 39, no. 1, pp. 168-194, 2009.