Polar Codes are Optimal for Lossy Source Coding

Details Polar Codes are Optimal for Lossy Source Coding Polar Codes are Optimal for Lossy Source Coding

2009-03-02

arxiv.org/abs/0903.0307v1

Computer Science

Information Theory

15 pages, submitted to Transactions on Information Theory

Scientific paper

We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar codes achieve the capacity of arbitrary symmetric binary-input discrete memoryless channels under a successive decoding strategy. We show the equivalent result for lossy source compression, i.e., we show that this combination achieves the rate-distortion bound for a binary symmetric source. We further show the optimality of polar codes for various problems including the binary Wyner-Ziv and the binary Gelfand-Pinsker problem

Affiliated with

Also associated with

No associations

Rating

Polar Codes are Optimal for Lossy Source Coding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polar Codes are Optimal for Lossy Source Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polar Codes are Optimal for Lossy Source Coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-78215