Capacity-achieving multiwrite WOM codes

Research output: Contribution to journalArticlepeer-review


In this paper, we give an explicit construction of a family of capacity-achieving binary t-write WOM codes for any number of writes t, which have polynomial time encoding and decoding algorithms. The block length of our construction is N=(t/ε)O(t/(δε)) when ε is the gap to capacity and encoding and decoding run in time N1+δ. This is the first deterministic construction achieving these parameters. Our techniques also apply to larger alphabets.

Original languageEnglish
Article number6680743
Pages (from-to)1481-1487
Number of pages7
JournalIEEE Transactions on Information Theory
Issue number3
StatePublished - Mar 2014
Externally publishedYes


  • Coding theory
  • Flash memories
  • Hash-functions
  • WOM-codes
  • Write-once memories


Dive into the research topics of 'Capacity-achieving multiwrite WOM codes'. Together they form a unique fingerprint.

Cite this