vix.ing · top · new · best · stats · spec

Polar write once memory codes

2012/07/03 by David Burshtein, Burshtein, David, Alona Strugatski +1
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #DNA and Biological Computing #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1207.0782

submitted for publication

openalex publication_date 2012/07/03 · arxiv created 2012/10/07 · arxiv updated 2012/10/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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

Citations

Related