Design and decoding of polar codes with large kernels: a survey
From MaRDI portal
Publication:6137611
Recommendations
Cites work
- A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes
- Arıkan Meets Shannon: Polar Codes With Near-Optimal Convergence to Channel Capacity
- Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels
- Binary Polarization Kernels From Code Decompositions
- Box and Match Techniques Applied to Soft-Decision Decoding
- Channel Coding Rate in the Finite Blocklength Regime
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- How to Achieve the Capacity of Asymmetric Channels
- How to Construct Polar Codes
- LLR-Based Successive Cancellation List Decoding of Polar Codes
- Linear and Nonlinear Binary Kernels of Polar Codes of Small Dimensions With Maximum Exponents
- List Decoding of Polar Codes
- Modern Coding Theory
- Polar Codes for $q$-Ary Channels, $q=2^{r}$
- Polar Codes: Characterization of Exponent, Bounds, and Constructions
- Polar Codes’ Simplicity, Random Codes’ Durability
- Source and Channel Polarization Over Finite Fields and Reed–Solomon Matrices
- Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors
This page was built for publication: Design and decoding of polar codes with large kernels: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137611)
