Burst-covering radius of binary cyclic codes is bounded using LFSR sequences, with a new bound on pattern frequencies for primitive BCH codes.
A note on optimum burst-error-correcting 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
-
On the burst-covering radius of binary cyclic codes
Burst-covering radius of binary cyclic codes is bounded using LFSR sequences, with a new bound on pattern frequencies for primitive BCH codes.