Abstract
M.Ing.
Certain properties of codewords after deletions or insertions of bits are investigated. This is used in the enumeration of the number of subwords or superwords after deletions or insertions. Also, new upper bounds for insertion/deletion correcting codes are derived from
these properties. A decoding algorithm to correct up to two deletions per word for Helberg's s = 2 codes is proposed. By using subword and superword tables, new s = 2 codebooks with greater cardinalities than before are presented. An insertion/deletion channel model is presented which can be used in evaluating insertion/deletion correcting codes. By changing the parameters, various channel configurations can be attained. Furthermore, a new convolutional coding scheme for correcting insertion/deletion errors is introduced and an investigation of the performance is done by using the presented
channel model.