On perfect deletion-correcting codes
✍ Scribed by Andreas Klein
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 84 KB
- Volume
- 12
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
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.
📜 SIMILAR VOLUMES
Lobstein, A.C., On perfect arithmetic codes, Discrete Mathematics 106/107 (1992) 333-336 This short paper treats the perfect codes, in the case of arithmetic codes and Garcia-Rao modular distance.