Polar Coding Without Alphabet Extension for Asymmetric Models

DOI10.1109/TIT.2013.2282305MaRDI QIDQ5346192zbMATH OpenOpenAlexFDO

Authors Junya Honda, Hirosuke Yamamoto

Publication date 8 June 2017

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

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

Mathematics Subject Classification ID

Information theory (general) (94A15) Measures of information, entropy (94A17) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Polar Coding for Non-Stationary Channels
• On the Construction of Polar Codes for Channels With Moderate Input Alphabet Sizes
• Polar Codes: Characterization of Exponent, Bounds, and Constructions
• Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets
• On Polar Coding for Side Information Channels
• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• Polarization and polar codes
• Polar Codes for the m-User Multiple Access Channel
• Polar Coding for Channels With Deletions
• Construction of Polar Codes for Arbitrary Discrete Memoryless Channels

Cited in

(4)

• Polar codes for distributed hierarchical source coding
• Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling
• Interactive function computation via polar coding
• Probabilistic Amplitude Shaping

This page was built for publication: Polar Coding Without Alphabet Extension for Asymmetric Models

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