Presents capacity-achieving constructions for weakly constrained codes via Eulerian cycles, expurgated codes with linear minimum distance, and a polynomial-time concatenated construction.
Error-resilient weakly constrained coding via row-by-row coding,
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
-
Error-Correcting Weakly Constrained Codes: Constructions and Achievable Rates
Presents capacity-achieving constructions for weakly constrained codes via Eulerian cycles, expurgated codes with linear minimum distance, and a polynomial-time concatenated construction.