Optimal codes in deletion and insertion metric

Details Optimal codes in deletion and insertion metric Optimal codes in deletion and insertion metric

2008-10-21

arxiv.org/abs/0810.3729v2

Computer Science

Information Theory

19 pages,The material of this paper was presented in part at the 10th International Workshop on Algebraic and Combinatorial Co

Scientific paper

We improve the upper bound of Levenshtein for the cardinality of a code of
length 4 capable of correcting single deletions over an alphabet of even size.
We also illustrate that the new upper bound is sharp. Furthermore we will
construct an optimal perfect code capable of correcting single deletions for
the same parameters.

Affiliated with

Also associated with

No associations

Rating

Optimal codes in deletion and insertion metric does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal codes in deletion and insertion metric, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal codes in deletion and insertion metric will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-572488