← 研踪 PaperTrailarXiv: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
摘要
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 arrays of arbitrary permutation matrices, sampled uniformly subject to commutation. For fixed column weight and fixed even row weight , we prove that the relative minimum distance converges to zero in probability as , with block length . 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 along even-weight sequences, exponentially many such representatives exist with high probability. Their typical and mean counts have exponent lower bound , where 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 yields the distance conclusion.
作者备注:17 pages, 1 figure
观测到的版本
相邻记录可能跳过中间版本;首次发现 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 arrays of arbitrary permutation matrices, sampled uniformly subject to commutation. For fixed column weight and fixed even row weight , we prove that the relative minimum distance converges to zero in probability as , with block length . 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 along even-weight sequences, exponentially many such representatives exist with high probability. Their typical and mean counts have exponent lower bound , where 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 yields the distance conclusion.
查看此版本解读 →查看此版本原文 ↗