Design of polar codes with large kernels

DOI10.1134/S0032946024040033MaRDI QIDQ7028801zbMATH OpenFDO

Authors P. V. Trifonov, G. A. Trofimiuk

Publication date 11 February 2025

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0032946024040033

zbMATH Keywords

large kernelspolar codespolar subcodes

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40) Other types of codes (94B60)

Cites work

• A posteriori probability decoding of nonsystematically encoded block codes
• Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels
• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• Convergence behavior of iteratively decoded parallel concatenated codes
• Design and decoding of polar codes with large kernels: a survey
• Extremes of Error Exponents
• How to Construct Polar Codes
• List Decoding of Polar Codes
• Modern Coding Theory
• On the formation of min-weight codewords of polar/PAC codes and its applications
• Polar Codes: Characterization of Exponent, Bounds, and Constructions
• Series of formulas for Bhattacharyya parameters in the theory of polar codes
• The capacity of binary channels that use linear codes and decoders
• The capacity of coded systems

This page was built for publication: Design of polar codes with large kernels

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