DocumentCode
3574
Title
Polar Write Once Memory Codes
Author
Burshtein, David ; Strugatski, Alona
Author_Institution
Sch. of Electr. Eng., Tel-Aviv Univ., Tel-Aviv, Israel
Volume
59
Issue
8
fYear
2013
fDate
Aug. 2013
Firstpage
5088
Lastpage
5101
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 subexponentially in N. The results can be generalized from binary to generalized WOMs, described by an arbitrary directed acyclic graph, using nonbinary polar codes. In the derivation, we also obtain results on the typical distortion of polar codes for lossy source coding. Some simulation results with finite length codes are presented.
Keywords
communication complexity; decoding; encoding; error statistics; arbitrary directed acyclic graph; decoding complexities scale; encoding complexities scale; error probability; finite length codes; lossy source coding; noiseless WOM; nonbinary polar codes; polar write once memory codes; Complexity theory; Decoding; Error probability; Random variables; Source coding; Vectors; Polar codes; write once memory codes (WOMs);
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2013.2255732
Filename
6491477
Link To Document