Publication

Polar Codes are Optimal for Lossy Source Coding

Rüdiger Urbanke
2009
Conference Papers

Abstract

We consider lossy source compression of a binary symmetric source with Hamming distortion function. We show that polar codes combined with a low-complexity successive cancellation encoding algorithm achieve the rate-distortion bound. The complexity of both the encoding and the decoding algorithm is O(N\log(N)), where N is the blocklength of the code. Our result mirrors Arikan's capacity achieving polar code construction for channel coding.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Polar Codes are Optimal for Lossy Source Coding

Chat with Graph Search

Subjective performance evaluation of bitrate allocation strategies for MPEG and JPEG Pleno point cloud compression

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation