Polar Codes are Optimal for Lossy Source Coding

DOI10.1109/TIT.2010.2040961MaRDI QIDQ5281535zbMATH OpenOpenAlexFDO

Authors Satish Babu Korada, Ruediger Urbanke

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2010.2040961

Mathematics Subject Classification ID

Source coding (94A29)

Cited in

(6)

• Achievable complexity-performance tradeoffs in lossy compression
• On basing private information retrieval on NP-hardness
• Interactive function computation via polar coding
• Reduction from sparse LPN to LPN, dual attack 3.0
• Assessing the impact of a variant of MATZOV's dual attack on Kyber
• HQC beyond the standard: ciphertext compression and refined DFR analysis

This page was built for publication: Polar Codes are Optimal for Lossy Source Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281535)