Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength

DOI10.1109/TIT.2013.2292061zbMath1364.94630arXiv0903.0566MaRDI QIDQ5346122

Jean-Pierre Tillich, Gilles Zémor

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0903.0566

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Quantum coding (general) (81P70)

Related Items (9)

Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders ⋮ On tensor products of CSS codes ⋮ Channel polarization of two-dimensional-input quantum symmetric channels ⋮ Unnamed Item ⋮ Homological quantum rotor codes: logical qubits from torsion ⋮ A construction of quantum turbo product codes based on CSS-type quantum convolutional codes ⋮ Building manifolds from quantum codes ⋮ A performance analysis of quantum low-density parity-check codes for correcting correlated errors ⋮ Quantum Codes from High-Dimensional Manifolds

This page was built for publication: Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength