Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Analysis of low density codes and improved designs using irregular graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Information Theory, Inference & Learning Algorithms
Information Theory, Inference & Learning Algorithms
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
The generalized distributive law
IEEE Transactions on Information Theory
Efficient encoding of low-density parity-check codes
IEEE Transactions on Information Theory
Sparse-graph codes for quantum error correction
IEEE Transactions on Information Theory
Nonbinary Stabilizer Codes Over Finite Fields
IEEE Transactions on Information Theory
On Quantum and Classical BCH Codes
IEEE Transactions on Information Theory
Convolutional and Tail-Biting Quantum Error-Correcting Codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Quantum LDPC codes with positive rate and minimum distance proportional to n 1/2
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Quantum Information Processing
On the construction of stabilizer codes with an arbitrary binary matrix
Quantum Information Processing
A class of quantum low-density parity check codes by combining seed graphs
Quantum Information Processing
| Hi-index | 0.06 |
We address the problem of decoding sparse quantum error correction codes. For Pauli channels, this task can be accomplished by a version of the belief propagation algorithm used for decoding sparse classical codes. Quantum codes pose two new challenges however. Firstly, their Tanner graph unavoidably contain small loops which typically undermines the performance of belief propagation. Secondly, sparse quantum codes are by definition highly degenerate. The standard belief propagation algorithm does not exploit this feature, but rather it is impaired by it. We propose heuristic methods to improve belief propagation decoding, specifically targeted at these two problems. While our results exhibit a clear improvement due to the proposed heuristic methods, they also indicate that the main source of errors in the quantum coding scheme remains in the decoding.