Nonbinary Codes That Correct Symbol Insertions, Drop-Outs, and Substitutions

The author constructs codes over $GF(q)$ with length $n$ not exceeding the size of the alphabet $q$ that correct single insertions, drop-outs, and substitutions of letters in words. Bounds are given for the volume of the constructed codes. Methods of constructing short codes of maximum volume are considered.