List decoding of polar codes
We describe a successive-cancellation list decoder for polar codes, which is a
generalization of the classic successive-cancellation decoder of Arıkan. In the proposed list …
generalization of the classic successive-cancellation decoder of Arıkan. In the proposed list …
LLR-based successive cancellation list decoding of polar codes
A Balatsoukas-Stimming, MB Parizi… - IEEE transactions on …, 2015 - ieeexplore.ieee.org
We show that successive cancellation list decoding can be formulated exclusively using log-
likelihood ratios. In addition to numerical stability, the log-likelihood ratio based formulation …
likelihood ratios. In addition to numerical stability, the log-likelihood ratio based formulation …
CRC-aided decoding of polar codes
K Niu, K Chen - IEEE communications letters, 2012 - ieeexplore.ieee.org
CRC (cyclic redundancy check)-aided decoding schemes are proposed to improve the
performance of polar codes. A unified description of successive cancellation decoding and …
performance of polar codes. A unified description of successive cancellation decoding and …
From sequential decoding to channel polarization and back again
E Arıkan - arXiv preprint arXiv:1908.09594, 2019 - arxiv.org
This note is a written and extended version of the Shannon Lecture I gave at 2019
International Symposium on Information Theory. It gives an account of the original ideas that …
International Symposium on Information Theory. It gives an account of the original ideas that …
How to construct polar codes
A method for efficiently constructing polar codes is presented and analyzed. Although polar
codes are explicitly defined, straightforward construction is intractable since the resulting …
codes are explicitly defined, straightforward construction is intractable since the resulting …
Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
E Arikan - IEEE Transactions on information Theory, 2009 - ieeexplore.ieee.org
A method is proposed, called channel polarization, to construct code sequences that
achieve the symmetric capacity I(W) of any given binary-input discrete memoryless channel …
achieve the symmetric capacity I(W) of any given binary-input discrete memoryless channel …
Overview of the challenges and solutions for 5G channel coding schemes
M Indoonundon, T Pawan Fowdur - Journal of Information and …, 2021 - Taylor & Francis
ABSTRACT 5G is the next generation of mobile communications networks which will use
cutting-edge network technologies to deliver enhanced mobile connectivity. 5G has …
cutting-edge network technologies to deliver enhanced mobile connectivity. 5G has …
[图书][B] Handbook of finite fields
GL Mullen, D Panario - 2013 - api.taylorfrancis.com
The CRC Handbook of Finite Fields (hereafter referred to as the Handbook) is a reference
book for the theory and applications of finite fields. It is not intended to be an introductory …
book for the theory and applications of finite fields. It is not intended to be an introductory …
Polar codes and their quantum-domain counterparts
Arikan's polar codes are capable of approaching Shannon's capacity at a low encoding and
decoding complexity, while conveniently supporting rate adaptation. By virtue of these …
decoding complexity, while conveniently supporting rate adaptation. By virtue of these …
An adaptive successive cancellation list decoder for polar codes with cyclic redundancy check
B Li, H Shen, D Tse - IEEE communications letters, 2012 - ieeexplore.ieee.org
In this letter, we propose an adaptive SC (Successive Cancellation)-List decoder for polar
codes with CRC. This adaptive SC-List decoder iteratively increases the list size until at least …
codes with CRC. This adaptive SC-List decoder iteratively increases the list size until at least …