High sum-rate three-write and non-binary WOM codes

Write-once memory (WOM) is a storage medium with memory elements, called cells, which can take on q levels. Each cell is initially in level 0 and can only increase its level. A t-write WOM code is a coding scheme which allows one to store t messages to the WOM such that on consecutive writes every cell's level does not decrease. The sum-rate of the WOM code, which is the ratio between the total amount of information written in the t writes and the number of memory cells, is bounded by log2(t + 1). Our main contribution in this work is a construction of binary three-write WOM codes with sum-rate approaching 1.885 for sufficiently large number of cells, while the upper bound is 2. This improves upon a recent construction of sum-rate 1.809. We also give constructions of non-binary WOM codes which give better sum-rate than the currently best known ones.

[1]  Paul H. Siegel,et al.  Multilevel 2-cell t-write codes , 2012, 2012 IEEE Information Theory Workshop.

[2]  Gérard D. Cohen,et al.  Linear binary code for write-once memories , 1986, IEEE Trans. Inf. Theory.

[3]  Eitan Yaakobi,et al.  Short q-ary WOM codes with hot/cold write differentiation , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[4]  Khaled A. S. Abdel-Ghaffar,et al.  Error-Correcting Codes for Flash Coding , 2011, IEEE Transactions on Information Theory.

[5]  A. J. Han Vinck,et al.  On the Capacity of Generalized Write-Once Memory with State Transitions Described by an Arbitrary Directed Acyclic Graph , 1999, IEEE Trans. Inf. Theory.

[6]  Yunnan Wu,et al.  Position Modulation Code for Rewriting Write-Once Memories , 2009, IEEE Transactions on Information Theory.

[7]  Frans Merkx.  09 - Womcodes constructed with projective geometries , 1984 .

[8]  Paul H. Siegel,et al.  Efficient two-write WOM-codes , 2010, 2010 IEEE Information Theory Workshop.

[9]  Paul H. Siegel,et al.  Multiple-write WOM-codes , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[10]  Chris Heegard,et al.  On the capacity of permanent memory , 1985, IEEE Trans. Inf. Theory.

[11]  Eitan Yaakobi,et al.  High Sum-Rate Three-Write and Nonbinary WOM Codes , 2014, IEEE Trans. Inf. Theory.

[12]  Lara Dolecek,et al.  Non-binary WOM-codes for multilevel flash memories , 2011, 2011 IEEE Information Theory Workshop.

[13]  Amir Shpilka.  New Constructions of WOM Codes Using the Wozencraft Ensemble , 2013, IEEE Transactions on Information Theory.

[14]  David Burshtein,et al.  Polar write once memory codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[15]  Lara Dolecek,et al.  Characterizing capacity achieving write once memory codes for multilevel flash memories , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[16]  Philippe Godlewski.  Wom-codes construits à partir des codes de hamming , 1987, Discret. Math..

[17]  Jack K. Wolf,et al.  Coding for a write-once memory , 1984, AT&T Bell Laboratories Technical Journal.

[18]  Yunnan Wu,et al.  Low complexity codes for writing a write-once memory twice , 2010, 2010 IEEE International Symposium on Information Theory.

[19]  Amy Hsiu-Fen Chou,et al.  Flash Memories , 2000, The VLSI Handbook.

[20]  A. Fiat,et al.  Generalized 'write-once' memories , 1984, IEEE Trans. Inf. Theory.

[21]  David Burshtein,et al.  Polar Write Once Memory Codes , 2013, IEEE Trans. Inf. Theory.

[22]  P. Godlewski,et al.  WOM-code constructs from Hamming codes , 1987 .

[23]  Thomas M. Cover,et al.  Enumerative source encoding , 1973, IEEE Trans. Inf. Theory.

[24]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[25]  Jørn Justesen,et al.  Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.

[26]  W. Marsden.  I and J , 2012 .

[27]  Christine A. Kelley,et al.  Geometric WOM codes and coding strategies for multilevel flash memories , 2012, Des. Codes Cryptogr..

[28]  Paul H. Siegel,et al.  Codes for Write-Once Memories , 2012, IEEE Transactions on Information Theory.

[29]  Brian M. Kurkoski.  Lattice-based WOM codebooks that allow two writes , 2012, 2012 International Symposium on Information Theory and its Applications.

[30]  Amir Shpilka,et al.  Capacity-Achieving Multiwrite WOM Codes , 2012, IEEE Transactions on Information Theory.

[31]  Adi Shamir,et al.  How to Reuse a "Write-Once" Memory , 1982, Inf. Control..