Relaxed protograph entries as Bernoulli edge probabilities enable deterministic DE-based gradient descent that yields LDPC base graphs outperforming 5G references of the same size.
On the design of low-density parity-check codes within 0.0045 db of the Shannon limit,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Learning LDPC codes with quantized density evolution over relaxed protographs
Relaxed protograph entries as Bernoulli edge probabilities enable deterministic DE-based gradient descent that yields LDPC base graphs outperforming 5G references of the same size.