|
|
Problemy Peredachi Informatsii, 1988, Volume 24, Issue 3, Pages 42–54
(Mi ppi708)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Information Theory and Coding Theory
Nonbinary Codes with Distances 4, 5, and 6 of Cardinality Greater than the BCH Codes
I. I. Dumer
Abstract:
We construct linear $q$-ary codes with distances 4, 5, and 6 in which the number of check symbols for $q>4$ increases with the increase of code length more slowly than for BCH codes. Decoding algorithms are considered.
Received: 24.03.1986
Citation:
I. I. Dumer, “Nonbinary Codes with Distances 4, 5, and 6 of Cardinality Greater than the BCH Codes”, Probl. Peredachi Inf., 24:3 (1988), 42–54; Problems Inform. Transmission, 24:3 (1988), 205–214
Linking options:
https://www.mathnet.ru/eng/ppi708 https://www.mathnet.ru/eng/ppi/v24/i3/p42
|
|