Book contents
- Frontmatter
- Contents
- Preface
- Abbreviations
- 1 Introduction
- 2 Basics
- 3 Erasure Channel Models and Bounds
- 4 Low-Density Parity-Check Codes
- 5 Weight Distribution and Minimum Distance of LDPC Codes
- 6 Iterative and Maximum-Likelihood Decoding of LDPC Codes
- 7 Iterative LDPC Decoder Analysis
- 8 Maximum-Likelihood LDPC Decoder Analysis
- 9 Low-Density Parity-Check Codes: Generalizations
- 10 Polar Codes
- 11 Fountain Codes
- Appendix A Applications of Erasure Codes
- Appendix B Random Matrices over Finite Fields
- Index
- References
10 - Polar Codes
Published online by Cambridge University Press: aN Invalid Date NaN
Book contents
- Frontmatter
- Contents
- Preface
- Abbreviations
- 1 Introduction
- 2 Basics
- 3 Erasure Channel Models and Bounds
- 4 Low-Density Parity-Check Codes
- 5 Weight Distribution and Minimum Distance of LDPC Codes
- 6 Iterative and Maximum-Likelihood Decoding of LDPC Codes
- 7 Iterative LDPC Decoder Analysis
- 8 Maximum-Likelihood LDPC Decoder Analysis
- 9 Low-Density Parity-Check Codes: Generalizations
- 10 Polar Codes
- 11 Fountain Codes
- Appendix A Applications of Erasure Codes
- Appendix B Random Matrices over Finite Fields
- Index
- References
Summary
Among the most recent proposals for error corrections there are the Polar codes. These are described in Chapter 10. This chapter describes polar codes, which are block codes designed for simplifying the implementation of the decoder. Specifically, polar codes are designed assuming a successive cancellation (SC) decoder. Channel polarization and subchannel ranking are discussed in this chapter.
Information
- Type
- Chapter
- Information
- Coding for Erasure Channels , pp. 269 - 287Publisher: Cambridge University PressPrint publication year: 2026
References
Arıkan, E., “Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,” IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051–3073, Jul. 2009.10.1109/TIT.2009.2021379CrossRefGoogle Scholar
Stolte, N., “Rekursive codes mit der Plotkin-konstruktion und ihre decodierung (Recursive Codes with the Plotkin-Construction and Their Decoding),” Ph.D. dissertation, Technische Universität Darmstadt, 2002.Google Scholar
Kudekar, S., Kumar, S., Mondelli, M., Pfister, H. D., Şaşoǧlu, E., and Urbanke, R. L., “Reed–Muller codes achieve capacity on erasure channels,” IEEE Trans. Inf. Theory, vol. 63, no. 7, p. 4298–4316, July 2017.10.1109/TIT.2017.2673829CrossRefGoogle Scholar
Kumar, S., Calderbank, R., and Pfister, H. D., “Beyond double transitivity: Capacity-achieving cyclic codes on erasure channels,” in Proc. IEEE Inf. Theory Workshop, Cambridge, UK, Sep. 2016, p. 241–245.Google Scholar
Reeves, G. and Pfister, H. D., “Reed–Muller codes on BMS channels achieve vanishing bit-error probability for all rates below capacity,” IEEE Trans. Inf. Theory, vol. 70, no. 2, p. 920–949, Feb. 2024.10.1109/TIT.2023.3286452CrossRefGoogle Scholar
Abbe, E., Sberlo, O., Shpilka, A., and Ye, M., “Reed-Muller codes,” Foundations and Trends in Communications and Information Theory, vol. 20, no. 1–2, p. 1–156, 2023.CrossRefGoogle Scholar
Arıkan, E., “A performance comparison of polar codes and Reed-Muller codes,” IEEE Commun. Lett., vol. 12, no. 6, 2008.Google Scholar
Leroux, C., Raymond, A. J., Sarkis, G., Tal, I., Vardy, A., and Gross, W. J., “Hardware implementation of successive-cancellation decoders for polar codes,” J. Signal Processing Systems, vol. 69, no. 3, pp. 305–315, 2012.CrossRefGoogle Scholar
Trifonov, P., “Efficient design and decoding of polar codes,” IEEE Trans. Commun., vol. 60, no. 11, pp. 3221–3227, 2012.10.1109/TCOMM.2012.081512.110872CrossRefGoogle Scholar
Chen, K., Niu, K., and Lin, J., “Improved successive cancellation decoding of polar codes,” IEEE Trans. Commun., vol. 61, no. 8, pp. 3100–3107, 2013.CrossRefGoogle Scholar
Tal, I. and Vardy, A., “List decoding of polar codes,” IEEE Trans. Inf. Theory, vol. 61, no. 5, pp. 2213–2226, May 2015.10.1109/TIT.2015.2410251CrossRefGoogle Scholar
Mondelli, M., Hassani, S. H., and Urbanke, R. L., “Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors,” IEEE Trans. Inf. Theory, vol. 62, no. 12, pp. 6698–6712, 2016.10.1109/TIT.2016.2616117CrossRefGoogle Scholar
Arıkan, E. and Telatar, E., “On the rate of channel polarization,” in Proc. IEEE Int. Symp. Inf. Theory, Seoul, South Korea, 2009, pp. 1493–1495.Google Scholar
Alsan, M. and Telatar, E., “A simple proof of polarization and polarization for non-stationary memoryless channels,” IEEE Trans. Inf. Theory, vol. 62, no. 9, pp. 4873–4878, 2016.CrossRefGoogle Scholar
Błasiok, J., Guruswami, V., Nakkiran, P., Rudra, A., and Sudan, M., “General strong polarization,” in Proc. ACM Symp. Theory of Comput. Los Angeles, CA, USA, June 2018, pp. 485–492.Google Scholar
Bardet, M., Dragoi, V., Otmani, A., and Tillich, J. P., “Algebraic properties of polar codes from a new polynomial formalism,” in Proc. IEEE Int. Symp. Inf. Theory, Barcelona, Spain, July 2016, pp. 230–234.Google Scholar
Wu, W., Fan, B., and Siegel, P. H., “Generalized partial orders for polar code bit-channels,” in Proc. Ann. Allerton Conf. on Commun., Control, and Comput., Monticello, IL, USA, Oct. 2017, pp. 541–548.Google Scholar
Trifonov, P. and Miloslavskaya, V., “Polar subcodes,” IEEE J. Sel. Areas Commun., vol. 34, no. 2, pp. 254–266, 2016.10.1109/JSAC.2015.2504269CrossRefGoogle Scholar
Coşkun, M. C., Neu, J., and Pfister, H. D., “Successive cancellation inactivation decoding for modified Reed-Muller and eBCH codes,” in Proc. IEEE Int. Symp. Inf. Theory. Los Angeles, CA, USA, June 2020, pp. 437–442.Google Scholar
Accessibility standard: WCAG 2.2 A
Why this information is here
This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.Accessibility Information
The PDF of this book
complies with version 2.2 of the
Web Content Accessibility Guidelines
(WCAG), offering more comprehensive accessibility measures for a broad range
of users and meets the basic
(A)
level of WCAG compliance, addressing essential accessibility barriers.
Content Navigation
Table of contents navigation
Allows you to navigate directly to chapters, sections, or non‐text items through a linked table of contents, reducing the need for extensive scrolling.
Allows you to navigate directly to chapters, sections, or non‐text items through a linked table of contents, reducing the need for extensive scrolling.
Index navigation
Provides an interactive index, letting you go straight to where a term or subject appears in the text without manual searching.
Provides an interactive index, letting you go straight to where a term or subject appears in the text without manual searching.
Reading Order & Textual Equivalents
Single logical reading order
You will encounter all content (including footnotes, captions, etc.) in a clear, sequential flow, making it easier to follow with assistive tools like screen readers.
You will encounter all content (including footnotes, captions, etc.) in a clear, sequential flow, making it easier to follow with assistive tools like screen readers.
Short alternative textual descriptions
You get concise descriptions (for images, charts, or media clips), ensuring you do not miss crucial information when visual or audio elements are not accessible.
You get concise descriptions (for images, charts, or media clips), ensuring you do not miss crucial information when visual or audio elements are not accessible.