Answers are grounded in this paper and cite their sources.
The letter introduces a construction of extended BCH polarization kernels, which admit simple computation of the probabilities or log-likelihood ratios arising in the successive cancellation decoding algorithm. The kernels are obtained by finding a column permutation of extended BCH kernels with natural column order, such that the total complexity of the associated trellises is minimized.
No takes yet. Share an insight, caveat, or question.
Moskovskaya et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: