Polar Code Construction for List Decoding
Information Theory
2018-08-03 v2 math.IT
Abstract
A heuristic construction of polar codes for successive cancellation list (SCL) decoding with a given list size is proposed to balance the trade-off between performance measured in frame error rate (FER) and decoding complexity. Furthermore, a construction based on dynamically frozen bits with constraints among the "low weight bits" (LWB) is presented. Simulation results show that the LWB-polar codes outperform the CRC-polar codes and the eBCH-polar codes under SCL decoding.
Keywords
Cite
@article{arxiv.1707.09753,
title = {Polar Code Construction for List Decoding},
author = {Peihong Yuan and Tobias Prinz and Georg Böcherer and Onurcan İşcan and Ronald Böhnke and Wen Xu},
journal= {arXiv preprint arXiv:1707.09753},
year = {2018}
}
Comments
6 pages