Detecting Deletions and Insertions in Concatenated Strings with Optimal Redundancy

by   Serge Kas Hanna, et al.

We study codes that can detect the exact number of deletions and insertions in concatenated binary strings. We construct optimal codes for the case of detecting up to deletions. We prove the optimality of these codes by deriving a converse result which shows that the redundancy of our codes is asymptotically optimal in among all families of deletion detecting codes, and particularly optimal among all block-by-block decodable codes. For the case of insertions, we construct codes that can detect up to 2 insertions in each concatenated binary string.


page 1

page 2

page 3

page 4


Wajsberg algebras arising from binary block codes

In this paper we presented some connections between BCK-commutative boun...

Wedge-Lifted Codes

We define wedge-lifted codes, a variant of lifted codes, and we study th...

Quaternary linear codes and related binary subfield codes

In this paper, we mainly study quaternary linear codes and their binary ...

On Coding over Sliced Information

The interest in channel models in which the data is sent as an unordered...

The zero-rate threshold for adversarial bit-deletions is less than 1/2

We prove that there exists an absolute constant δ>0 such any binary code...

Use of Set Shaping theory in the development of locally testable codes

In developing locally testable codes, information is added to the coded ...

Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets

Synchronization strings are recently introduced by Haeupler and Shahrasb...