Performance of Polar Codes for Channel and Source Coding

Simple item page
dc.creatorHussami, Nadine
dc.creatorKorada, Satish Babu
dc.creatorUrbanke, Rudiger
dc.date2009-01-16
dc.date2009-05-22
dc.date.accessioned2026-07-07T13:17:00Z
dc.date.available2026-07-07T13:17:00Z
dc.descriptionPolar codes, introduced recently by Arı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.
dc.descriptionaccepted in ISIT 2009, Figure 5 is different from the previous version
dc.identifierhttps://arxiv.org/abs/0901.2370
dc.identifierhttp://arxiv.org/abs/0901.2370
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/230973
dc.subjectInformation Theory
dc.titlePerformance of Polar Codes for Channel and Source Coding
dc.typetext

Files

Collections

arXiv