A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Log-domain decoding of quantum LDPC codes over binary finite fields
2021
IEEE Transactions on Quantum Engineering
A quantum stabilizer code over GF(q) corresponds to a classical additive code over GF(q 2 ) that is self-orthogonal with respect to a symplectic inner product. We study the decoding of quantum lowdensity parity-check (LDPC) codes over binary finite fields GF(q = 2 l ) by the sum-product algorithm, also known as belief propagation (BP). Conventionally, a message in a nonbinary BP for quantum codes over GF(2 l ) represents a probability vector over GF(2 2l ), inducing high decoding complexity. In
doi:10.1109/tqe.2021.3113936
fatcat:fzjpfr7oy5huxetdy2kra547vu