A new framework with coset-weight generating functions and local growth analysis improves upper bounds on the rate-distance tradeoff for LDPC codes beyond prior work.
Binary codes with specified minimum distance.IRE Transactions on Information Theory, 6(4):445–450, 1960
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Local 2D and 3D Reed-Muller distillation factories achieve output infidelities down to 8.256e-9 for CCZ states and 1.1811e-17 for T states from 10^{-3} input infidelity.
citing papers explorer
-
Improved Rate-versus-Distance Upper Bounds for LDPC Codes
A new framework with coset-weight generating functions and local growth analysis improves upper bounds on the rate-distance tradeoff for LDPC codes beyond prior work.
-
Local distillation from Reed Muller codes unfolding
Local 2D and 3D Reed-Muller distillation factories achieve output infidelities down to 8.256e-9 for CCZ states and 1.1811e-17 for T states from 10^{-3} input infidelity.