Abstract: | In this article, we present constructions for perfect deletion‐correcting codes. The first construction uses perfect deletion‐correcting codes without repetition of letters to construct other perfect deletion‐correcting codes. This is a generalization of the construction shown in 1 . In the third section, we investigate several constructions of perfect deletion‐correcting codes using designs. In the last section, we investigate perfect deletion‐correcting codes containing few codewords. © 2003 Wiley Periodicals, Inc. |