Applies Combinatorial Nullstellensatz to derive sufficient memory conditions for SC-LDPC protographs to destroy all 4-cycles and all 4- and 6-cycles, plus lower bounds on the number of such feasible edge-spreading assignments.
A strategy to detect error propagation in sliding window decoding of SC-LDPC codes
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
-
Existence and Counting Bounds for High-Memory Spatially-Coupled Codes via the Combinatorial Nullstellensatz
Applies Combinatorial Nullstellensatz to derive sufficient memory conditions for SC-LDPC protographs to destroy all 4-cycles and all 4- and 6-cycles, plus lower bounds on the number of such feasible edge-spreading assignments.