Optimal codes in deletion and insertion metric
نویسندگان
چکیده
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.
منابع مشابه
Construction of optimal codes in deletion and insertion metric
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.
متن کاملPruned Convolutional Codes and Viterbi Decoding Using the Levenshtein Distance Metric Applied to Asynchronous Noisy Channels
For a convolutional encoding and Viterbi decoding system, two insertion/deletion/substitution (IDS) error correcting techniques are presented in this paper. In the first means, by using the pruned convolutional codes, a rate compatible encoding system can adapt the transmission according to the state of the channel having IDS errors. In the second means, a convolutional encoded sequence is deco...
متن کاملOn multiple insertion/Deletion correcting codes
We investigate binary, number-theoretic, bit insertion/deletion correcting codes as pioneered by Levenshtein. The weight spectra and Hamming distance properties of single insertion/deletion error-correcting codes are analyzed. These relationships are then extended to investigate codes that can correct multiple random insertions and deletions. From these relationships, new bounds are derived and...
متن کاملInsertion/deletion Correction by Using Parallel- Interconnected Viterbi Decoders
A new insertion/deletion correction scheme is presented for standard convolutional codes that makes use of multiple parallel-interconnected Viterbi decoders. Whenever an insertion or deletion error occurs, the connections between different Viterbi decoders ensure that decoding will proceed from the decoder that is in synchronization. In this way, a larger Viterbi decoder is created that can cor...
متن کاملInsertion and Deletion for Involution Codes
This paper introduces a generalization of the operation of catenation: u[k]lv, the left-k-insertion, is the set of all words obtained by inserting v into u in positions that are at most k letters away from the left extremity of the word u. We define k-suffix codes using the left-kinsertion operation and extend the concept of k-prefix and k-suffix codes to involution k-prefix and involution k-su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0810.3729 شماره
صفحات -
تاریخ انتشار 2008