{"product_id":"polar-codes-from-theory-to-practice-hardback-9781119911739","title":"Polar Codes; From Theory to Practice (Hardback) 9781119911739","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003ePolar Codes\u003c\/font\u003e\u003cbr\u003e\r\n\u003cfont size=\"5\"\u003eFrom Theory to Practice\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eMohammad Rowshan (Author), Emanuele Viterbo (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9781119911739, Wiley\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 17 December 2025\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e384 pages\u003cbr\u003e28 x 19 x 2.5 cm, 0.785 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003e\u003cp\u003e\u003cb\u003eUnderstand a cutting-edge new class of error correction codes with this introduction\u003c\/b\u003e \u003c\/p\u003e\n\u003cp\u003eChannel coding is a pivotal technique employed to account for potential errors due to channel noise or interference by adding layers of redundancy to information prior to transmission or storage. Should errors appear in the transmitted sequence upon reaching its destination, they can be corrected with reference to the redundant layers. Polar codes are a new class of error correction codes that provably achieve the capacity of binary discrete memoryless channels. Their distinct advantages have led to their incorporation in the logical control channels of the fifth generation of wireless communications (5G). Possessing robust and competitive error correction capabilities for short and medium-length codes positions them strategically to fulfill a pivotal role in various communication systems as we move towards the sixth generation of wireless communication (6G) and beyond. \u003c\/p\u003e\n\u003cp\u003e\u003ci\u003ePolar Codes\u003c\/i\u003e provides a thorough, accessible overview of this new class of codes and its applications. Beginning with the foundational theories underlying polar codes, it guides readers through the construction of polar codes, their variants, and their encoding and decoding processes. The result is a must-have for coding researchers and professionals looking to develop an edge in the wireless communications of the future. \u003c\/p\u003e\n\u003cp\u003e\u003ci\u003ePolar Codes\u003c\/i\u003e readers will also find: \u003c\/p\u003e\n\u003cul\u003e\n\u003cli\u003e Continuous connections between discussed concepts and current 5G standards\u003c\/li\u003e\n\u003cli\u003e Snippets of code in MATLAB\/Python to illustrate key tools\u003c\/li\u003e\n\u003cli\u003e End of chapter problems and bibliographical notes to facilitate learning and provide references for further reading.\u003c\/li\u003e\n\u003c\/ul\u003e \u003cp\u003e\u003ci\u003ePolar Codes\u003c\/i\u003e is ideal for graduate students and researchers in coding and information theory, as well as engineers working in communications and related industries.\u003c\/p\u003e\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e\u003cp\u003eAbout the Authors xv\u003c\/p\u003e \u003cp\u003ePreface xvii\u003c\/p\u003e \u003cp\u003eAcknowledgment xxi\u003c\/p\u003e \u003cp\u003e\u003cb\u003e1 Introduction 1\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e1.1 Reliable Transmission over Noisy Channels 2\u003c\/p\u003e \u003cp\u003e1.2 Channel Models 4\u003c\/p\u003e \u003cp\u003e1.2.1 Binary Symmetric Channel (BSC) 4\u003c\/p\u003e \u003cp\u003e1.2.2 Binary Erasure Channel (BEC) 5\u003c\/p\u003e \u003cp\u003e1.2.3 Additive White Gaussian Noise Channel (AWGN) 6\u003c\/p\u003e \u003cp\u003e1.2.4 Fading Channel 7\u003c\/p\u003e \u003cp\u003e1.3 Fundamentals of Information Theory 7\u003c\/p\u003e \u003cp\u003e1.3.1 The Meaning of Information 8\u003c\/p\u003e \u003cp\u003e1.3.2 Discrete Entropy 9\u003c\/p\u003e \u003cp\u003e1.3.3 Properties of the Discrete Entropy 10\u003c\/p\u003e \u003cp\u003e1.3.4 Mutual Information 11\u003c\/p\u003e \u003cp\u003e1.3.5 Bhattacharyya Parameter 12\u003c\/p\u003e \u003cp\u003e1.4 Channel Capacity and Channel Coding Theorem 13\u003c\/p\u003e \u003cp\u003e1.5 Block Error Rate for Finite Length Codes 15\u003c\/p\u003e \u003cp\u003e1.6 Shannon Limit on Power Efficiency 17\u003c\/p\u003e \u003cp\u003e1.7 Time and Space Complexity 19\u003c\/p\u003e \u003cp\u003e1.8 Historical Milestones in Channel Coding 20\u003c\/p\u003e \u003cp\u003e1.9 Why Study Polar Codes? 24\u003c\/p\u003e \u003cp\u003e1.9.1 How Do Polar Codes Compare with Other Codes? 25\u003c\/p\u003e \u003cp\u003eExercises 26\u003c\/p\u003e \u003cp\u003eBibliographic Notes 27\u003c\/p\u003e \u003cp\u003eBibliography 28\u003c\/p\u003e \u003cp\u003e\u003cb\u003e2 Linear Codes 29\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e2.1 Generator and Parity-Check Matrices 29\u003c\/p\u003e \u003cp\u003e2.2 Distance, Weight, and Bounds 32\u003c\/p\u003e \u003cp\u003e2.3 Syndrome Decoding 35\u003c\/p\u003e \u003cp\u003e2.4 Repetition and Single Parity Check Codes 37\u003c\/p\u003e \u003cp\u003e2.5 Reed–Muller Codes 37\u003c\/p\u003e \u003cp\u003e2.5.1 Boolean Functions and Boolean Polynomials 38\u003c\/p\u003e \u003cp\u003e2.5.1.1 Evaluation of Monomials 38\u003c\/p\u003e \u003cp\u003e2.5.1.2 Boolean Products 40\u003c\/p\u003e \u003cp\u003e2.5.1.3 Boolean Polynomials 40\u003c\/p\u003e \u003cp\u003e2.5.2 Submatrix of Binary Walsh–Hadamard Matrix 41\u003c\/p\u003e \u003cp\u003e2.5.3 Plotkin’s Construction 42\u003c\/p\u003e \u003cp\u003e2.6 Cyclic Codes 45\u003c\/p\u003e \u003cp\u003e2.6.1 Arithmetic of Polynomials 45\u003c\/p\u003e \u003cp\u003e2.6.2 Generator Polynomial and Encoding 46\u003c\/p\u003e \u003cp\u003e2.6.3 Cyclic Redundancy Check (CRC) for Error Detection 50\u003c\/p\u003e \u003cp\u003e2.7 Convolutional Codes 52\u003c\/p\u003e \u003cp\u003e2.7.1 Encoding of Convolutional Codes 53\u003c\/p\u003e \u003cp\u003e2.7.1.1 Encoding with Sequential Logic 53\u003c\/p\u003e \u003cp\u003e2.7.1.2 Impulse Response and Convolution 53\u003c\/p\u003e \u003cp\u003e2.7.1.3 Generator Matrix 54\u003c\/p\u003e \u003cp\u003e2.7.2 Termination, Truncation, and Tail-Biting 55\u003c\/p\u003e \u003cp\u003e2.7.3 Tree and Trellis 56\u003c\/p\u003e \u003cp\u003e2.8 Concatenated Codes 58\u003c\/p\u003e \u003cp\u003eExercises 61\u003c\/p\u003e \u003cp\u003eBibliographic Notes 63\u003c\/p\u003e \u003cp\u003eBibliography 63\u003c\/p\u003e \u003cp\u003e\u003cb\u003e3 Fundamentals of Soft-Decision Decoding 65\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e3.1 MAP\/ML Decoding and Likelihood 66\u003c\/p\u003e \u003cp\u003e3.1.1 Log-Likelihood Ratio (LLR) 68\u003c\/p\u003e \u003cp\u003e3.1.2 LLR Algebra 69\u003c\/p\u003e \u003cp\u003e3.1.3 Maximum-Likelihood (ML) Bound 70\u003c\/p\u003e \u003cp\u003e3.1.4 Union Bound 70\u003c\/p\u003e \u003cp\u003e3.2 Reliability-Based Universal Decoding 73\u003c\/p\u003e \u003cp\u003e3.3 Recursive Decoding 75\u003c\/p\u003e \u003cp\u003e3.4 Message-Passing (MP) Decoding 78\u003c\/p\u003e \u003cp\u003e3.4.1 Factorization and Factor Graph 78\u003c\/p\u003e \u003cp\u003e3.4.2 Message Passing 79\u003c\/p\u003e \u003cp\u003e3.4.3 The Effect of Cycles on Message Passing 82\u003c\/p\u003e \u003cp\u003e3.4.3.1 Scenario with Cycles 83\u003c\/p\u003e \u003cp\u003e3.5 Tree\/Trellis-Based Search Decoding 84\u003c\/p\u003e \u003cp\u003e3.5.1 Sequential Decoding 84\u003c\/p\u003e \u003cp\u003e3.5.1.1 Fano Algorithm 85\u003c\/p\u003e \u003cp\u003e3.5.1.2 Stack Decoding 85\u003c\/p\u003e \u003cp\u003e3.5.1.3 Path Metric 86\u003c\/p\u003e \u003cp\u003e3.5.1.4 Computational Cutoff-Rate 87\u003c\/p\u003e \u003cp\u003e3.5.2 List Decoding 88\u003c\/p\u003e \u003cp\u003e3.5.3 Trellis-Based Viterbi Decoding 88\u003c\/p\u003e \u003cp\u003e3.5.4 Lattice-Based Sphere Decoding 89\u003c\/p\u003e \u003cp\u003eExercises 89\u003c\/p\u003e \u003cp\u003eBibliographic Notes 89\u003c\/p\u003e \u003cp\u003eBibliography 91\u003c\/p\u003e \u003cp\u003e\u003cb\u003e4 Polar Codes 95\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e4.1 Introduction 96\u003c\/p\u003e \u003cp\u003e4.2 Basic Channel Transform 97\u003c\/p\u003e \u003cp\u003e4.3 Recursive Channel Transformation 99\u003c\/p\u003e \u003cp\u003e4.4 Channel Polarization 103\u003c\/p\u003e \u003cp\u003e4.5 Code Construction Based on Z (W(i)\u003ci\u003eN\u003c\/i\u003e) 107\u003c\/p\u003e \u003cp\u003e4.6 G N -Coset Codes 110\u003c\/p\u003e \u003cp\u003e4.7 Successive Cancellation (SC) Decoding 110\u003c\/p\u003e \u003cp\u003e4.8 Performance of Polar Codes Under SC Decoding 112\u003c\/p\u003e \u003cp\u003eExercises 117\u003c\/p\u003e \u003cp\u003eBibliographical Notes 117\u003c\/p\u003e \u003cp\u003eBibliography 118\u003c\/p\u003e \u003cp\u003e\u003cb\u003e5 Properties of Polar Codes 121\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e5.1 Polar Transform 122\u003c\/p\u003e \u003cp\u003e5.2 Permutation Matrix 123\u003c\/p\u003e \u003cp\u003e5.3 Generator and Parity Check Matrices 125\u003c\/p\u003e \u003cp\u003e5.4 Systematic Polar Codes 126\u003c\/p\u003e \u003cp\u003e5.5 Reed–Muller Codes Versus Polar Codes 128\u003c\/p\u003e \u003cp\u003e5.6 Partial Order of Sub-channels 129\u003c\/p\u003e \u003cp\u003e5.7 Minimum Distance of Polar Codes 132\u003c\/p\u003e \u003cp\u003e5.8 Minimum Weight Codewords 133\u003c\/p\u003e \u003cp\u003e5.8.1 Construction of Minimum Weight Codewords 133\u003c\/p\u003e \u003cp\u003e5.8.1.1 \u003ci\u003eM\u003c\/i\u003e-Construction 135\u003c\/p\u003e \u003cp\u003e5.8.2 Enumeration of Minimum Weight Codewords 139\u003c\/p\u003e \u003cp\u003e5.9 Exponent of Polarizing Matrix 140\u003c\/p\u003e \u003cp\u003e5.10 Polar Codes with Large and Mixed Kernels 142\u003c\/p\u003e \u003cp\u003e5.10.1 Large Kernel Polar Codes 142\u003c\/p\u003e \u003cp\u003e5.10.2 Mixed\/Multi-Kernel Polar Codes 142\u003c\/p\u003e \u003cp\u003e5.11 Properties of SC Decoding 143\u003c\/p\u003e \u003cp\u003e5.11.1 Updating Intermediate LLRs 144\u003c\/p\u003e \u003cp\u003e5.11.2 Updating Partial Sums 145\u003c\/p\u003e \u003cp\u003e5.11.3 Partial Rewind: Updating LLRs and Partial Sums 147\u003c\/p\u003e \u003cp\u003e5.12 Partial Sums and Polar Constituent Codes 149\u003c\/p\u003e \u003cp\u003eExercises 150\u003c\/p\u003e \u003cp\u003eBibliographical Notes 151\u003c\/p\u003e \u003cp\u003eBibliography 152\u003c\/p\u003e \u003cp\u003e\u003cb\u003e6 Construction of Polar Codes 155\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e6.1 Code Construction 156\u003c\/p\u003e \u003cp\u003e6.2 Channel-Dependent Code Construction 157\u003c\/p\u003e \u003cp\u003e6.2.1 Density Evolution 157\u003c\/p\u003e \u003cp\u003e6.2.2 Density Evolution with Gaussian Approximation 158\u003c\/p\u003e \u003cp\u003e6.3 Channel-Independent Code Construction 161\u003c\/p\u003e \u003cp\u003e6.3.1 Universal Partial Order (UPO) 161\u003c\/p\u003e \u003cp\u003e6.3.1.1 Nested and Symmetric Properties 163\u003c\/p\u003e \u003cp\u003e6.3.2 Polarization Weight (PW) 164\u003c\/p\u003e \u003cp\u003e6.4 5G Code Construction 166\u003c\/p\u003e \u003cp\u003e6.5 Code Construction for ML Decoding 166\u003c\/p\u003e \u003cp\u003e6.5.1 RM-Polar Codes 168\u003c\/p\u003e \u003cp\u003e6.6 Pre-transformed Polar Codes 170\u003c\/p\u003e \u003cp\u003e6.6.1 CRC-Polar Codes 170\u003c\/p\u003e \u003cp\u003e6.6.1.1 CRC Bits in 5G 171\u003c\/p\u003e \u003cp\u003e6.6.2 Parity-Check (PC)-Polar Codes 172\u003c\/p\u003e \u003cp\u003e6.6.2.1 PC Bits in 5G 173\u003c\/p\u003e \u003cp\u003e6.6.3 PAC Codes 174\u003c\/p\u003e \u003cp\u003e6.6.3.1 Minimum Distance of PAC Codes 175\u003c\/p\u003e \u003cp\u003e6.6.3.2 Invariant Coset 176\u003c\/p\u003e \u003cp\u003e6.6.3.3 Lower Bound for Awmin (PG, A) 177\u003c\/p\u003e \u003cp\u003eExercises 178\u003c\/p\u003e \u003cp\u003eBibliographic Notes 178\u003c\/p\u003e \u003cp\u003eBibliography 181\u003c\/p\u003e \u003cp\u003e\u003cb\u003e7 Monomial Codes and Permutations 185\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e7.1 Monomial Codes 185\u003c\/p\u003e \u003cp\u003e7.1.1 Evaluation of a Monomial 186\u003c\/p\u003e \u003cp\u003e7.1.2 Reed–Muller Codes 187\u003c\/p\u003e \u003cp\u003e7.2 Polar Codes as Monomial Codes 188\u003c\/p\u003e \u003cp\u003e7.2.1 Codeword as a Polynomial 189\u003c\/p\u003e \u003cp\u003e7.3 Decreasing Monomial Codes 190\u003c\/p\u003e \u003cp\u003e7.3.1 Partial Order 190\u003c\/p\u003e \u003cp\u003e7.4 Permutation Group 192\u003c\/p\u003e \u003cp\u003e7.4.1 Symmetric Permutation Group 193\u003c\/p\u003e \u003cp\u003e7.4.2 Lower Triangular Affine (LTA) Permutation Group 194\u003c\/p\u003e \u003cp\u003e7.4.3 Orbit of a Monomial, Orb(f) 196\u003c\/p\u003e \u003cp\u003e7.4.4 Restricted LTA Transform\/Permutation Group 197\u003c\/p\u003e \u003cp\u003e7.4.5 Block Lower Triangular Affine (BLTA) Permutation Group 199\u003c\/p\u003e \u003cp\u003e7.5 Stabilizer Group 202\u003c\/p\u003e \u003cp\u003e7.5.1 Stabilizer Group Structure 202\u003c\/p\u003e \u003cp\u003e7.6 Permutation Ensemble Decoding 203\u003c\/p\u003e \u003cp\u003e7.7 Enumeration of Min-Weight Codewords 207\u003c\/p\u003e \u003cp\u003e7.8 Structure of Codewords with Larger Weights 209\u003c\/p\u003e \u003cp\u003eExercises 214\u003c\/p\u003e \u003cp\u003eBibliographical Notes 215\u003c\/p\u003e \u003cp\u003eBibliography 215\u003c\/p\u003e \u003cp\u003e\u003cb\u003e8 List Decoding of Polar Codes 217\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e8.1 SC List Decoding 217\u003c\/p\u003e \u003cp\u003e8.1.1 Error Events in SCL Decoding 222\u003c\/p\u003e \u003cp\u003e8.1.2 List Size in SCL Decoding 222\u003c\/p\u003e \u003cp\u003e8.1.3 List Decoding of CRC-Polar Codes 224\u003c\/p\u003e \u003cp\u003e8.1.4 List Decoding of PAC Codes 225\u003c\/p\u003e \u003cp\u003e8.2 Iterative SC-Based Decoding 226\u003c\/p\u003e \u003cp\u003e8.2.1 Adaptive List Decoding 227\u003c\/p\u003e \u003cp\u003e8.2.2 SC Decoding with Bit-Flipping 228\u003c\/p\u003e \u003cp\u003e8.2.3 SCL Decoding with Diverse Path-Selection 229\u003c\/p\u003e \u003cp\u003e8.2.4 SC\/SCL Decoding with Perturbation 229\u003c\/p\u003e \u003cp\u003e8.2.5 Partial Rewind of SC and SCL Decoding 230\u003c\/p\u003e \u003cp\u003eExercises 235\u003c\/p\u003e \u003cp\u003eBibliographical Notes 236\u003c\/p\u003e \u003cp\u003eBibliography 237\u003c\/p\u003e \u003cp\u003e\u003cb\u003e9 Fast SC-Based Decoding 241\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e9.1 SC Decoding via Special Nodes 241\u003c\/p\u003e \u003cp\u003e9.2 Rate-1 Node 243\u003c\/p\u003e \u003cp\u003e9.3 Rate-0 Node 243\u003c\/p\u003e \u003cp\u003e9.4 Rate-C Node 244\u003c\/p\u003e \u003cp\u003e9.5 Repetition Nodes 244\u003c\/p\u003e \u003cp\u003e9.5.1 General Repetition Node 244\u003c\/p\u003e \u003cp\u003e9.6 Parity Check Nodes 246\u003c\/p\u003e \u003cp\u003e9.6.1 General Parity Check Node 247\u003c\/p\u003e \u003cp\u003e9.7 Fast SC List Decodings 250\u003c\/p\u003e \u003cp\u003eExercises 250\u003c\/p\u003e \u003cp\u003eBibliographical Notes 251\u003c\/p\u003e \u003cp\u003eBibliography 251\u003c\/p\u003e \u003cp\u003e\u003cb\u003e10 Alternative Decoding Algorithms 253\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e10.1 Belief Propagation (BP) Decoding 254\u003c\/p\u003e \u003cp\u003e10.2 Sequential Decoding 261\u003c\/p\u003e \u003cp\u003e10.3 Sphere Decoding 263\u003c\/p\u003e \u003cp\u003e10.4 Reliability-Based Generic Decoding 264\u003c\/p\u003e \u003cp\u003e10.4.1 Ordered Statistics Decoding (OSD) 264\u003c\/p\u003e \u003cp\u003e10.4.2 Guessing Random Additive Noise Decoding (GRAND) 268\u003c\/p\u003e \u003cp\u003eExercises 272\u003c\/p\u003e \u003cp\u003eBibliographical Notes 273\u003c\/p\u003e \u003cp\u003eBibliography 276\u003c\/p\u003e \u003cp\u003e\u003cb\u003e11 Rate-Compatible Polar Codes 281\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e11.1 Modification of Block Codes 282\u003c\/p\u003e \u003cp\u003e11.1.1 Shortened Codes 282\u003c\/p\u003e \u003cp\u003e11.1.2 Punctured Codes 282\u003c\/p\u003e \u003cp\u003e11.2 Punctured Polar Codes 284\u003c\/p\u003e \u003cp\u003e11.3 Shortened Polar Codes 285\u003c\/p\u003e \u003cp\u003e11.4 Rate-Matching in 5G NR 287\u003c\/p\u003e \u003cp\u003e11.4.1 The Mother Code and Rate-Matching Choice 288\u003c\/p\u003e \u003cp\u003e11.4.2 Subblock Interleaving 288\u003c\/p\u003e \u003cp\u003e11.4.3 Bit-Selection 289\u003c\/p\u003e \u003cp\u003eExercises 290\u003c\/p\u003e \u003cp\u003eBibliographical Notes 290\u003c\/p\u003e \u003cp\u003eBibliography 291\u003c\/p\u003e \u003cp\u003e\u003cb\u003e12 Polar-Coded Modulation 293\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e12.1 Higher-Order Modulation 294\u003c\/p\u003e \u003cp\u003e12.1.1 Constellations and Distance Between Signal Points 294\u003c\/p\u003e \u003cp\u003e12.1.2 Binary Labeling of Signal Points 296\u003c\/p\u003e \u003cp\u003e12.2 Multilevel-Coded Modulation 296\u003c\/p\u003e \u003cp\u003e12.2.1 Labeling Signal Points in S by Partition Chain 297\u003c\/p\u003e \u003cp\u003e12.2.2 Choosing \u003ci\u003em\u003c\/i\u003e Binary Component Codes 298\u003c\/p\u003e \u003cp\u003e12.2.3 Interleaving Component Codes and Mapping 299\u003c\/p\u003e \u003cp\u003e12.2.4 Multistage Decoding of BCM Codes 301\u003c\/p\u003e \u003cp\u003e12.3 Bit-Interleaved Polar-Coded Modulation 302\u003c\/p\u003e \u003cp\u003e12.4 Bit-Interleaving in 5G NR 304\u003c\/p\u003e \u003cp\u003eExercises 306\u003c\/p\u003e \u003cp\u003eBibliographical Notes 306\u003c\/p\u003e \u003cp\u003eBibliography 307\u003c\/p\u003e \u003cp\u003e\u003cb\u003e13 Performance Comparisons 309\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e13.1 Error Correction Performance of Polar Codes 309\u003c\/p\u003e \u003cp\u003e13.2 Performance Comparison of Turbo, LDPC, and Polar Codes 315\u003c\/p\u003e \u003cp\u003eBibliographical Notes 317\u003c\/p\u003e \u003cp\u003eBibliography 317\u003c\/p\u003e \u003cp\u003e\u003cb\u003e14 5G New Radio (NR) Polar Coding with MATLAB ® 319\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e14.1 Polar Encoding 319\u003c\/p\u003e \u003cp\u003e14.1.1 Uplink 320\u003c\/p\u003e \u003cp\u003e14.1.2 Downlink 320\u003c\/p\u003e \u003cp\u003e14.2 Rate-Matching and Rate-Recovery 322\u003c\/p\u003e \u003cp\u003e14.2.1 Modulation and Channel Effect 323\u003c\/p\u003e \u003cp\u003e14.3 Polar Decoding 323\u003c\/p\u003e \u003cp\u003e14.4 BLER Versus SNR of a Code—Full Script 324\u003c\/p\u003e \u003cp\u003eAppendix A Conceptual Channels in 5G New Radio 329\u003c\/p\u003e \u003cp\u003eAppendix B Channel Coding from 2G to 5G 335\u003c\/p\u003e \u003cp\u003eB. 1 AJourneyfrom2Gto5G 335\u003c\/p\u003e \u003cp\u003eB. 2 Channel Coding in 2G 335\u003c\/p\u003e \u003cp\u003eB. 3 Channel Coding in 3G 337\u003c\/p\u003e \u003cp\u003eB.3. 1 Block Segmentation and Rate Matching 337\u003c\/p\u003e \u003cp\u003eB. 4 Channel Coding in 4G 338\u003c\/p\u003e \u003cp\u003eB. 5 Channel Coding in 5G 339\u003c\/p\u003e \u003cp\u003eBibliography 340\u003c\/p\u003e \u003cp\u003eAppendix C Scripts 341\u003c\/p\u003e \u003cp\u003eC. 1 Meta-Converse Bound with a Normal Approximation 341\u003c\/p\u003e \u003cp\u003eC. 2 Shannon Limit 342\u003c\/p\u003e \u003cp\u003eC. 3 Standard Array in Syndrome Decoding 342\u003c\/p\u003e \u003cp\u003eC. 4 Polar Sequence in 5G 343\u003c\/p\u003e \u003cp\u003eC. 5 Calculating CRC Bits 345\u003c\/p\u003e \u003cp\u003eC. 6 Polar Transform and Its Permutation Matrix 345\u003c\/p\u003e \u003cp\u003eC. 7 Polar Code Construction 346\u003c\/p\u003e \u003cp\u003eC. 8 Row Structure of Minimum-Weight Codewords 349\u003c\/p\u003e \u003cp\u003eC. 9 Closed-Form Weight Enumeration 350\u003c\/p\u003e \u003cp\u003eIndex 353\u003c\/p\u003e\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Electronics \u0026amp; communications engineering [\u003ca title=\"See our other books on Electronics \u0026amp; communications engineering\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Electronics%20\u0026amp;%20communications%20engineering%20%5BTJ%5D%22\"\u003eTJ\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Wiley-IEEE Press","offers":[{"title":"Brand New","offer_id":52431010857240,"sku":"9781119911739","price":87.38,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/files\/9781119911739.jpg?v=1784768567","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/polar-codes-from-theory-to-practice-hardback-9781119911739","provider":"Freshly Printed Books","version":"1.0","type":"link"}