Arikan’s Polar codes [1] attracted much attention as the first efficiently decodable and capacity achieving codes. Furthermore, Polar codes exhibit an exponentially decreasing block error probability with an asymptotic error exponent upper bounded by β < 1 2 . Since their discovery, many attempts have been made to improve the error exponent and the finite block-length performance, while keeping...

Quantum reading provides a general framework where to formulate the statistical discrimination of quantum channels. Several paths have been taken for such problem. However, there is much be done in avenue optimizing channel using classical codes. At least two open questions can pointed to: how construct low complexity encoding schemes that are interesting and, more importantly, develop capacity...

We improve the method in [1] for increasing the finite-lengh performance of polar codes by protecting specific, less reliable symbols with simple outer repetition codes. Decoding of the scheme integrates easily in the known successive decoding algorithms for polar codes. Overall rate and block length remain unchanged, the decoding complexity is at most doubled. A comparison to related methods f...