Polar write once memory codes

David Burshtein, Alona Strugatski

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publication2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages1972-1976
Number of pages5
DOIs
StatePublished - 2012
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: 1 Jul 20126 Jul 2012

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Conference

Conference2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/TerritoryUnited States
CityCambridge, MA
Period1/07/126/07/12

Fingerprint

Dive into the research topics of 'Polar write once memory codes'. Together they form a unique fingerprint.

Cite this