betaFeedback

WorksPhysics and Astronomy

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

Abstract

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.

Paper details

vlnc:W_4qpdttzz
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…