Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}

Jean-Pierre Tillich, Gilles Zemor · 2009 · IEEE Trans. Inf. Theory 60(2), 1193-1202 (2014)

| 编号 QE112 | 主题 qLDPC 码 | 链接 arXiv:0903.0566 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

The current best asymptotic lower bound on the minimum distance of quantum LDPC codes with fixed non-zero rate is logarithmic in the blocklength. We propose a construction of quantum LDPC codes with fixed non-zero rate and prove that the minimum distance grows proportionally to the square root of the blocklength.

本站词条在引用该文献时，会以 wikilink（sources/QE112）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。