RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 1988 Volume 24, Issue 3, Pages 42–54 (Mi ppi708)
This article is cited 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.

UDC: 621.391.15:681.3.053

Received: 24.03.1986


 English version: Problems of Information Transmission, 1988, 24:3, 205–214

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025