Capacity-achieving multiwrite WOM codes

Amir Shpilka

doi:10.1109/TIT.2013.2294464

Capacity-achieving multiwrite WOM codes

Amir Shpilka^*

^*Corresponding author for this work

Technion-Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

28 Scopus citations

Abstract

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 N^1+δ. This is the first deterministic construction achieving these parameters. Our techniques also apply to larger alphabets.

Original language	English
Article number	6680743
Pages (from-to)	1481-1487
Number of pages	7
Journal	IEEE Transactions on Information Theory
Volume	60
Issue number	3
DOIs	https://doi.org/10.1109/TIT.2013.2294464
State	Published - Mar 2014
Externally published	Yes

Keywords

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

Access to Document

10.1109/TIT.2013.2294464

Cite this

@article{4029d57550864780a497bf550605b9af,

title = "Capacity-achieving multiwrite WOM codes",

abstract = "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.",

keywords = "Coding theory, Flash memories, Hash-functions, WOM-codes, Write-once memories",

author = "Amir Shpilka",

year = "2014",

month = mar,

doi = "10.1109/TIT.2013.2294464",

language = "אנגלית",

volume = "60",

pages = "1481--1487",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "3",

}

TY - JOUR

T1 - Capacity-achieving multiwrite WOM codes

AU - Shpilka, Amir

PY - 2014/3

Y1 - 2014/3

N2 - 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.

AB - 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.

KW - Coding theory

KW - Flash memories

KW - Hash-functions

KW - WOM-codes

KW - Write-once memories

UR - http://www.scopus.com/inward/record.url?scp=84894852997&partnerID=8YFLogxK

U2 - 10.1109/TIT.2013.2294464

DO - 10.1109/TIT.2013.2294464

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84894852997

SN - 0018-9448

VL - 60

SP - 1481

EP - 1487

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 3

M1 - 6680743

ER -

Capacity-achieving multiwrite WOM codes

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this