Polar Codes are Optimal for Lossy Source Coding

Simple item page
dc.creatorKorada, Satish Babu
dc.creatorUrbanke, Rudiger
dc.date2009-03-02
dc.date.accessioned2026-07-07T12:48:11Z
dc.date.available2026-07-07T12:48:11Z
dc.descriptionWe 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
dc.description15 pages, submitted to Transactions on Information Theory
dc.identifierhttps://arxiv.org/abs/0903.0307
dc.identifierhttp://arxiv.org/abs/0903.0307
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/221967
dc.subjectInformation Theory
dc.titlePolar Codes are Optimal for Lossy Source Coding
dc.typetext

Files

Collections

arXiv