Refined rate of channel polarization

2010/01/13 by Toshiyuki Tanaka, Ryuhei Mori, Tanaka, Toshiyuki +1
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1001.2067

5 or 6 pages, submitted to IEEE Int. Symp. Info. Theory 2010

arxiv created 2010/01/13 · arxiv updated 2010/01/14

Abstract

A rate-dependent upper bound of the best achievable block error probability of polar codes with successive-cancellation decoding is derived.

Related

• Improved Bounds on the Finite Length Scaling of Polar Codes
• Universal Bounds on the Scaling Behavior of Polar Codes
• Binary Polar Codes Based on Bit Error Probability
• Faulty Successive Cancellation Decoding of Polar Codes for the Binary Erasure Channel
• A Lower Bound on the Probability of Error of Polar Codes over BMS Channels