Polar write once memory codes

David Burshtein; Alona Strugatski

doi:https://doi.org/10.1109/ISIT.2012.6283644

Polar write once memory codes

David Burshtein, Alona Strugatski

School of Electrical Engineering

Tel Aviv University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

A coding scheme for write once memory (WOM) using polar codes is presented. It is shown that the scheme achieves the capacity region of noiseless WOMs when an arbitrary number of multiple writes is permitted. The encoding and decoding complexities scale as O(N log N) where N is the blocklength. For N sufficiently large, the error probability decreases sub-exponentially in N. Some simulation results with finite length codes are presented.

Original language	English
Title of host publication	2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages	1972-1976
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2012.6283644
State	Published - 2012
Event	2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States Duration: 1 Jul 2012 → 6 Jul 2012

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings

Conference

Conference	2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/Territory	United States
City	Cambridge, MA
Period	1/07/12 → 6/07/12

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

https://doi.org/10.1109/ISIT.2012.6283644

Cite this

@inproceedings{7b08745b735a4e10b7d62f8e3147cbc9,

title = "Polar write once memory codes",

abstract = "A coding scheme for write once memory (WOM) using polar codes is presented. It is shown that the scheme achieves the capacity region of noiseless WOMs when an arbitrary number of multiple writes is permitted. The encoding and decoding complexities scale as O(N log N) where N is the blocklength. For N sufficiently large, the error probability decreases sub-exponentially in N. Some simulation results with finite length codes are presented.",

author = "David Burshtein and Alona Strugatski",

year = "2012",

doi = "https://doi.org/10.1109/ISIT.2012.6283644",

language = "الإنجليزيّة",

isbn = "9781467325790",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1972--1976",

booktitle = "2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012",

note = "2012 IEEE International Symposium on Information Theory, ISIT 2012 ; Conference date: 01-07-2012 Through 06-07-2012",

}

Burshtein, D & Strugatski, A 2012, Polar write once memory codes. in 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012., 6283644, IEEE International Symposium on Information Theory - Proceedings, pp. 1972-1976, 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, United States, 1/07/12. https://doi.org/10.1109/ISIT.2012.6283644

TY - GEN

T1 - Polar write once memory codes

AU - Burshtein, David

AU - Strugatski, Alona

PY - 2012

Y1 - 2012

N2 - A coding scheme for write once memory (WOM) using polar codes is presented. It is shown that the scheme achieves the capacity region of noiseless WOMs when an arbitrary number of multiple writes is permitted. The encoding and decoding complexities scale as O(N log N) where N is the blocklength. For N sufficiently large, the error probability decreases sub-exponentially in N. Some simulation results with finite length codes are presented.

AB - A coding scheme for write once memory (WOM) using polar codes is presented. It is shown that the scheme achieves the capacity region of noiseless WOMs when an arbitrary number of multiple writes is permitted. The encoding and decoding complexities scale as O(N log N) where N is the blocklength. For N sufficiently large, the error probability decreases sub-exponentially in N. Some simulation results with finite length codes are presented.

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

U2 - https://doi.org/10.1109/ISIT.2012.6283644

DO - https://doi.org/10.1109/ISIT.2012.6283644

M3 - منشور من مؤتمر

SN - 9781467325790

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1972

EP - 1976

BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012

T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012

Y2 - 1 July 2012 through 6 July 2012

ER -

Polar write once memory codes

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this