Non-binary LDPC codes constructed from binary base matrices can achieve a newly defined ultimate distance in the q-ary erasure channel, supported by random-coding bounds and low-complexity search algorithms.
Computing the stopping distance of a Tanner graph is NP-hard
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Non-binary LDPC codes for Data Storage
Non-binary LDPC codes constructed from binary base matrices can achieve a newly defined ultimate distance in the q-ary erasure channel, supported by random-coding bounds and low-complexity search algorithms.