Distance Verification for Classical and Quantum LDPC Codes

DOI10.1109/TIT.2017.2690381zbMATH Open1370.81047arXiv1611.07164OpenAlexW2550118586MaRDI QIDQ5358595FDOQ5358595

Authors: Alexey A. Kovalev, Leonid P. Pryadko, I. I. Dumer 

Publication date: 21 September 2017

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

Abstract: The techniques of distance verification known for general linear codes are re-applied to quantum stabilizer codes. Then distance verification is addressed for classical and quantum LDPC codes. New complexity bounds for distance verification with provable performance are derived using the average weight spectra of the ensembles of LDPC codes. These bounds are expressed in terms of the erasure-correcting capacity of the corresponding ensemble. We also present a new irreducible-cluster technique that can be applied to any LDPC code and takes advantage of parity-checks' sparsity for both classical and quantum LDPC codes. This technique reduces complexity exponents of all existing deterministic techniques designed for generic stabilizer codes with small relative distances, which also include all known families of quantum LDPC codes.

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

Recommendations

• Quantum LDPC Codes With Almost Linear Minimum Distance
• A note on the minimum distance of quantum LDPC codes
• Asymptotically good Quantum and locally testable classical LDPC codes
• Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength
• Quantum MDS codes with large minimum distance
• Classic and Quantum Error Correcting Codes
• QKD iterative information reconciliation based on LDPC codes
• The Need for Structure in Quantum LDPC Codes
• Efficient Quantum Stabilizer Codes: LDPC and LDPC-Convolutional Constructions
• Quasi-perfect Lee distance codes

Mathematics Subject Classification ID

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

Cited In (1)

• Low-complexity cryptographic hash functions

This page was built for publication: Distance Verification for Classical and Quantum LDPC Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358595)