Mixed Materials
Capacity achieving multiwrite WOM codes
| Title: | Capacity achieving multiwrite WOM codes |
|---|---|
| Additional Titles: | 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. |
| Authors: | Shpilka, Amir |
| Publisher Information: | 2012-09-05 |
| Document Type: | Mixed materials |
| Abstract: | 14 pages |
| Index Terms: | Information Theory, Computational Complexity, text |
| URL: | |
| Availability: | Open access content. Open access content |
| Other Numbers: | COO oai:arXiv.org:1209.1128 815867306 |
| Contributing Source: | CORNELL UNIV From OAIster®, provided by the OCLC Cooperative. |
| Accession Number: | edsoai.ocn815867306 |
| Database: | OAIster |
| Description not available. |