跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.21389 · v1

Vanishing Relative Distance of Uniformly Random CSS LDPC Codes Built from Permutation Matrices

首次提交 2026-11-17 00:48
版本更新 2026-11-17 00:48
雷达观测 2026-11-17 16:10
arXiv ↗PDF ↗

摘要

Classical random regular low-density parity-check codes can have minimum distance growing linearly with block length. We study CSS check matrices formed as full J×LJ\times L arrays of arbitrary P×PP\times P permutation matrices, sampled uniformly subject to commutation. For fixed column weight J≥3J\ge3 and fixed even row weight L>2JL>2J, we prove that the relative minimum distance converges to zero in probability as P→∞P\to\infty, with block length n=LPn=LP. We analyze the weight enumerators that count all nontrivial logical representatives after excluding stabilizers. A coefficientwise lower bound shows that, at every fixed relative weight 0<α<10<α<1 along even-weight sequences, exponentially many such representatives exist with high probability. Their typical and mean counts have exponent lower bound h2(α)/2h_2(α)/2, where h2h_2 is the binary entropy function. We compare this bound with the classical LDPC and dense CSS mean weight-distribution exponents. The existence, with high probability, of a logical operator below every fixed target weight δnδn yields the distance conclusion.

作者备注:17 pages, 1 figure

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 00:48 · 最新观测版本

Vanishing Relative Distance of Uniformly Random CSS LDPC Codes Built from Permutation Matrices

Classical random regular low-density parity-check codes can have minimum distance growing linearly with block length. We study CSS check matrices formed as full J×LJ\times L arrays of arbitrary P×PP\times P permutation matrices, sampled uniformly subject to commutation. For fixed column weight J≥3J\ge3 and fixed even row weight L>2JL>2J, we prove that the relative minimum distance converges to zero in probability as P→∞P\to\infty, with block length n=LPn=LP. We analyze the weight enumerators that count all nontrivial logical representatives after excluding stabilizers. A coefficientwise lower bound shows that, at every fixed relative weight 0<α<10<α<1 along even-weight sequences, exponentially many such representatives exist with high probability. Their typical and mean counts have exponent lower bound h2(α)/2h_2(α)/2, where h2h_2 is the binary entropy function. We compare this bound with the classical LDPC and dense CSS mean weight-distribution exponents. The existence, with high probability, of a logical operator below every fixed target weight δnδn yields the distance conclusion.

查看此版本解读 →查看此版本原文 ↗