The asymptotic probability distribution of the relative distance of additive quantum codes

DOI10.1016/J.JMAA.2007.08.023zbMATH Open1130.81024OpenAlexW1999214606MaRDI QIDQ2467792FDOQ2467792

Yuefei Ma

Publication date: 28 January 2008

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2007.08.023

zbMATH Keywords

binary codesadditive quantum error-correcting codesquantum Gilbert-Varshamov bound

Mathematics Subject Classification ID

Cryptography (94A60) Quantum computation (81P68)

Cites Work

• Error Correcting Codes in Quantum Theory
• The intractability of computing the minimum distance of a code
• Fundamentals of Error-Correcting Codes
• Quantum Error Correction and Orthogonal Geometry
• Nonbinary quantum stabilizer codes
• Quantum error correction via codes over GF(4)
• Upper bounds on the size of quantum codes
• A Finite Gilbert–Varshamov Bound for Pure Stabilizer Quantum Codes
• Quantum error detection .II. Bounds

   Recommendations

• Title not available (Why is that?) 👍 👎
• Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound 👍 👎
• Distance Distribution of Binary Codes and the Error Probability of Decoding 👍 👎
• Asymptotic bounds on quantum codes from algebraic geometry codes 👍 👎
• \(\mathbb{Z}_p \mathbb{Z}_p[v\)-additive cyclic codes are asymptotically good] 👍 👎

This page was built for publication: The asymptotic probability distribution of the relative distance of additive quantum codes

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