Answers are grounded in this paper and cite their sources.
It is shown that for each integerb ≥ 1infinitely many optimum cyclicb-burst-correcting codes exist, i.e., codes whose lengthn, redundancyr, and burst-correcting capabilityb, satisfyn = 2ʳ⁻ᵇ⁺¹ - 1. Some optimum codes forb = 3, 4, and5are also studied in detail.
No takes yet. Share an insight, caveat, or question.
Abdel-Ghaffar et al. (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: