Year: 2012
Type: preprint
Abstract: In this paper we give an explicit construction of a capacity achieving family of binary t-write WOM codes for any number of writes t, that have a 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 N^{1+δ}. This is the first deterministic construction achieving these parameters. Our techniques also apply to larger alphabets.
Source: arXiv (Cornell University)
Author: Shpilka, Amir
Institution: Technion – Israel Institute of Technology
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2949900839