The SC–ML dominance conjecture for polar codes under list decoding
Consider two polar codes and with the same code length and message length . Let and denote their frame-error rates under successive-cancellation and maximum-likelihood decoding, respectively. SC–ML dominance conjecture. If either
or
then code outperforms code for every list size at high signal-to-noise ratio. The paper illustrates this with polar codes having similar AUBs and compares their performance for small and large list sizes.
References
- Peihong Yuan, Tobias Prinz, Georg Böcherer, Onurcan İşcan, Ronald Böhnke and Wen Xu, “Polar Code Construction for List Decoding”, arXiv:1707.09753 (2018).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.