Construction of optimal codes in deletion and insertion metric

Details Construction of optimal codes in deletion and insertion metric Construction of optimal codes in deletion and insertion metric

2010-03-22

arxiv.org/abs/1003.4057v1

Computer Science

Information Theory

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

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Construction of 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 Construction of 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 Construction of optimal codes in deletion and insertion metric will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-205988