Only on the Active Rows

Classical LDPC wants girth and regularity. Quantum codes also need two check families orthogonal so they don't read each other.

Enforce that everywhere and short loops and weak distance come back.

He kept orthogonality only on the active rows the decoder uses. Latent parent rows stay freer.

A (3,12)-regular girth-eight code: nine thousand two hundred sixteen physical, four thousand six hundred twelve logical — about one logical per two physical. Weight forty-eight logical operators sit. X- and Z-type distances on the latent structure are exactly forty-eight. Searches found no lighter. A global lower bound on d is still open.

Orthogonality barrier is a late mouth if you mean a wall broken. Looking if you stay with the constraint that used to force short cycles when it was everywhere.

The leftover is both: the code that already sits — numbers, girth, rate, the waterfall near the classical mark — and the open bound: the distance still not proved from below.