Mixed Materials
Capacity achieving multiwrite WOM codes
| Τίτλος: | 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. |
| Συγγραφείς: | Shpilka, Amir |
| Στοιχεία εκδότη: | 2012-09-05 |
| Τύπος εγγράφου: | Mixed materials |
| Περίληψη: | 14 pages |
| Όροι ευρετηρίου: | Information Theory, Computational Complexity, text |
| Σύνδεσμος: | |
| Διαθεσιμότητα: | Open access content. Open access content |
| Other Numbers: | COO oai:arXiv.org:1209.1128 815867306 |
| Πηγή συνεισφοράς: | CORNELL UNIV From OAIster®, provided by the OCLC Cooperative. |
| Αριθμός Καταχώρησης: | edsoai.ocn815867306 |
| Βάση Δεδομένων: | OAIster |
καταχωρήστε σχόλιο πρώτοι!