|
Problemy Peredachi Informatsii, 1983, Volume 19, Issue 2, Pages 14–22
(Mi ppi1172)
|
|
|
|
Coding Theory
Two Decyclical Lengthening Methods for Block Codes
V. Yu. Krachkovskii
Abstract:
The author proposes two lengthening methods for block codes that are variants of the constructs of decyclical lengthening. Their use makes it possible to construct new block codes with parameters that are better than the available ones. Suitable examples are given. By lengthening Hamming codes of length $2^m-1$ by $2m$ symbols, the author constructs a class of codes with minimum distance 7 and redundancy $3m$.
Received: 06.07.1981 Revised: 30.09.1982
Citation:
V. Yu. Krachkovskii, “Two Decyclical Lengthening Methods for Block Codes”, Probl. Peredachi Inf., 19:2 (1983), 14–22; Problems Inform. Transmission, 19:2 (1983), 97–105
Linking options:
https://www.mathnet.ru/eng/ppi1172 https://www.mathnet.ru/eng/ppi/v19/i2/p14
|
Statistics & downloads: |
Abstract page: | 205 | Full-text PDF : | 84 | First page: | 1 |
|