Korada and R. Urbanke; (Lossy Compression Data Compression)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n*{2}^n)$

Space Complexity

$O(N)$ words

(Derived: size of the polar codes that need to be stored)

Description

Polar codes

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2010

Reference

https://arxiv.org/pdf/0903.0307.pdf