2 papers
cs.IT2025
Codes Correcting Two Bursts of Exactly Deletions
Zuo Ye, Yubo Sun, Wenjun Yu +2
In this paper, we investigate codes designed to correct two bursts of deletions, where each burst has a length of exactly , where . The previous best construction, achieved…
cs.IT2025
On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs
Wenjun Yu, Bo-Jun Yuan, Moshe Schwartz
We study generalized fractional repetition codes that have zero skip cost, and which are based on covering designs. We show that a zero skip cost is always attainable, perhaps at a…