SCL decoding [1]} improves the error-correction performance of SC decoding by keeping a list of the most likely candidates at each decoding step. Instead of estimating each information bit as either 0 or 1 as in () and (), SCL decoding considers both possibilities 0 and 1. To avoid an exponential growth in the number of candidates, SCL decoding keeps the \(L\)  most likely ones based on calculating a path metric. The latency of SCL decoding can be modelled similar to that of SC decoding, with the addition of \(K\)  time steps to update and sort the path metrics.
