  We generalize Helberg's number-theoretic construction of multiple
insertion-deletion correcting binary codes to non-binary alphabets and describe
a linear decoding algorithm for correcting multiple deletions.
