A family of quantum codes with performances close to the hashing bound under iterative decoding
Denise Maurice, Jean–Pierre Tillich, Iryna Andriyanova · 2013
We propose here a new construction of quantum codes combining an improved version of a family of spatially coupled quantum LDPC codes, suggested in [1], with a family of error reducing turbo-codes of [2]. This new construction displays outstanding performances under iterative decoding for noise levels very close to the hashing bound, without needing qubits, protected from noise as in [1].