Non-binary Code Correcting Single b-Burst of Insertions or Deletions

04/13/2018
by   Toyohiko Saeki, et al.
0

This paper constructs a non-binary code correcting a single b-burst of insertions or deletions. This paper also proposes a decoding algorithm of this code and evaluates a lower bound of the cardinality of this code. Moreover, we evaluate an asymptotic upper bound on the cardinality of codes which can correct a single burst of insertions or deletions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/05/2021

Improved Asymptotic Bounds for Codes Correcting Insertions and Deletions

This paper studies the cardinality of codes correcting insertions and de...
research
10/13/2019

Perfect Multi Deletion Codes Achieve the Asymptotic Optimality of Code Size

This paper studies on the cardinality of perfect multi deletion binary c...
research
04/30/2020

Criss-Cross Deletion Correcting Codes

This paper studies the problem of constructing codes correcting deletion...
research
04/13/2018

Erasure Correcting Codes by Using Shift Operation and Exclusive OR

This paper proposes an erasure correcting code and its systematic form f...
research
12/24/2017

Duplication-Correcting Codes

In this work, we propose constructions that correct duplications of mult...
research
10/02/2016

Syntactic Structures and Code Parameters

We assign binary and ternary error-correcting codes to the data of synta...
research
11/09/2021

Arithmetic Autocorrelation of Binary m-Sequences

An m-sequence is the one of the largest period among those produced by a...

Please sign up or login with your details

Forgot password? Click here to reset