|
Problemy Peredachi Informatsii, 1985, Volume 21, Issue 1, Pages 35–39
(Mi ppi970)
|
|
|
|
Information Theory and Coding Theory
Nonbinary Codes That Correct Symbol Insertions, Drop-Outs, and Substitutions
A. S. Dolgopolov
Abstract:
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.
Received: 29.08.1983 Revised: 23.11.1983
Citation:
A. S. Dolgopolov, “Nonbinary Codes That Correct Symbol Insertions, Drop-Outs, and Substitutions”, Probl. Peredachi Inf., 21:1 (1985), 35–39; Problems Inform. Transmission, 21:1 (1985), 26–29
Linking options:
https://www.mathnet.ru/eng/ppi970 https://www.mathnet.ru/eng/ppi/v21/i1/p35
|
Statistics & downloads: |
Abstract page: | 396 | Full-text PDF : | 191 |
|