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 - 10.1109/ISIT.2012.6283644
DO - 10.1109/ISIT.2012.6283644
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84867496153
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 -