Polar Codes: Characterization of Exponent, Bounds, and Constructions

DOI10.1109/TIT.2010.2080990MaRDI QIDQ5281177zbMATH OpenFDO

Authors Satish Babu Korada, Eren Şaşoğlu, 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.2080990

Mathematics Subject Classification ID

Other types of codes (94B60) Bounds on codes (94B65)

Cited in

(14)

• On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length
• Polar codes with higher-order memory
• The exponent of a polarizing matrix constructed from the Kronecker product
• Scaling Exponent of List Decoders With Applications to Polar Codes
• Finite-Length Scaling for Polar Codes
• On Reed-Muller codes over F₂+u F₂ and some applications
• Exponents of polar codes using algebraic geometric code kernels
• On the Finite Length Scaling of <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math> </inline-formula>-Ary Polar Codes
• Algorithmic polarization for hidden Markov models
• Recursive descriptions of polar codes
• Polar Coding Without Alphabet Extension for Asymmetric Models
• Design and decoding of polar codes with large kernels: a survey
• Secure communication over zero-private capacity quantum channels
• Design of polar codes with large kernels

This page was built for publication: Polar Codes: Characterization of Exponent, Bounds, and Constructions

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