Analysis of syndrome-based iterative decoder failure of QLDPC codes

07/26/2023
by   Kirsten D. Morris, et al.
0

Iterative decoder failures of quantum low density parity check (QLDPC) codes are attributed to substructures in the code's graph, known as trapping sets, as well as degenerate errors that can arise in quantum codes. Failure inducing sets are subsets of codeword coordinates that, when initially in error, lead to decoding failure in a trapping set. In this paper we examine the failure inducing sets of QLDPC codes under syndrome-based iterative decoding, and their connecting to absorbing sets in classical LDPC codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/30/2020

Trapping Sets of Quantum LDPC Codes

Iterative decoders for finite length quantum low-density parity-check (Q...
research
06/15/2022

Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes

We introduce and analyse an efficient decoder for the quantum Tanner cod...
research
12/11/2019

A Code-specific Conservative Model for the Failure Rate of Bit-flipping Decoding of LDPC Codes with Cryptographic Applications

Characterizing the decoding failure rate of iteratively decoded Low- and...
research
01/15/2018

The decoding failure probability of MDPC codes

Moderate Density Parity Check (MDPC) codes are defined here as codes whi...
research
06/11/2020

Combinatorics with Copula for Code based Post-Quantum Cryptography

Codes have been proposed as useful tools in designing cryptosystem that ...
research
06/29/2021

Generalizing Syndrome Decoding problem to the totally Non-negative Grassmannian

The syndrome decoding problem has been proposed as a computational hardn...
research
04/18/2018

Stopping Redundancy Hierarchy Beyond the Minimum Distance

Stopping sets play a crucial role in failure events of iterative decoder...

Please sign up or login with your details

Forgot password? Click here to reset