Polar coding gives rise to the first explicit family of codes that provably achieve capacity with
efficient encoding and decoding for a wide range of channels. However, its performance at …

The generalization of the multiscale entanglement renormalization ansatz (MERA) to
continuous systems, or cMERA [Haegeman et al., Phys. Rev. Lett. 110, 100402 (2013) …

We construct an explicit quantum coding scheme which achieves a communication rate not
less than the coherent information when used to transmit the quantum information over a …

We introduce a new class of circuits for constructing efficiently decodable quantum and
classical error-correction codes, based on a recently discovered contractible tensor network …

The successive-cancellation flip (SCFlip) decoder and its variants provide a significant
coding gain with the average complexity practically identical to that of the successive …

A family of polarizing kernels is presented together with polynomial-complexity algorithm for
computing scaling exponent. The proposed convolutional polar kernels are based on …

A lower bound on the minimum distance of convolutional polar codes is provided. The
bound is obtained from the minimum weight of the generalized cosets of the codes …

This thesis considers the problem of information reconciliation in the context of secret key
distribution between two parties. We recognize polar codes as a “good” solution to this …

A simplified method for estimation of the minimum distance of convolutional polar codes is
proposed. It is based on a novel algorithm for computing the minimum weight of cosets of the …

The discovery of polar codes has been widely acknowledged as one of the most original
and profound breakthroughs in coding theory in the recent two decades. Polar codes form …