Polar Codes with Dynamic Frozen Symbols and Their Decoding by Directed Search

2013/07/09 by Peter Trifonov, Trifonov, Peter, Vera Miloslavskaya +1 · 3 citations
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1307.2352

Accepted to ITW2013

arxiv created 2013/07/10 · arxiv updated 2013/07/12

Abstract

A novel construction of polar codes with dynamic frozen symbols is proposed. The proposed codes are subcodes of extended BCH codes, which ensure sufficiently high minimum distance. Furthermore, a decoding algorithm is proposed, which employs estimates of the not-yet-processed bit channel error probabilities to perform directed search in code tree, reducing thus the total number of iterations.

Cited by

• SCL Decoding of Non-Binary Linear Block Codes
• DeepPolar+: Breaking the BER-BLER Trade-off with Self-Attention and SMART (SNR-MAtched Redundancy Technique) decoding
• Rate-Matching Deep Polar Codes via Polar Coded Extension

Related

• An Impedance-Modulated Code-Division Microwave SQUID Multiplexer
• Digital logic from high-efficiency superconducting diodes
• The Keck Array: a pulse tube cooled CMB polarimeter
• Low Noise Cold Electronics System for SBND LAr TPC
• Voltage-controlled Cryogenic Boolean Logic Family Based on Ferroelectric SQUID