Performance of Polar Codes for Channel and Source Coding

Details Performance of Polar Codes for Channel and Source Coding Performance of Polar Codes for Channel and Source Coding

2009-01-16

arxiv.org/abs/0901.2370v2

Computer Science

Information Theory

accepted in ISIT 2009, Figure 5 is different from the previous version

Scientific paper

Polar codes, introduced recently by Ar\i kan, are the first family of codes known to achieve capacity of symmetric channels using a low complexity successive cancellation decoder. Although these codes, combined with successive cancellation, are optimal in this respect, their finite-length performance is not record breaking. We discuss several techniques through which their finite-length performance can be improved. We also study the performance of these codes in the context of source coding, both lossless and lossy, in the single-user context as well as for distributed applications.

Affiliated with

Also associated with

No associations

Rating

Performance of Polar Codes for Channel and 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 Performance of Polar Codes for Channel and Source Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performance of Polar Codes for Channel and Source Coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-126841