2000 character limit reached
New Construction of -ary Codes Correcting a Burst of at most Deletions
Published 11 Jan 2024 in cs.IT and math.IT | (2401.05859v3)
Abstract: In this paper, for any fixed positive integers and , we construct -ary codes correcting a burst of at most deletions with redundancy bits and near-linear encoding/decoding complexity, where is the message length and is a constant that only depends on and . In previous works there are constructions of such codes with redundancy bits or . The redundancy of our new construction is independent of and in the second term.
Paper Prompts
Sign up for free to create and run prompts on this paper.