RUS
ENG
Full version
JOURNALS
// Problemy Peredachi Informatsii
// Archive
Probl. Peredachi Inf.,
2002
Volume 38,
Issue 1,
Pages
59–63
(Mi ppi1300)
This article is cited in
9
papers
Coding Theory
New One-Generator Quasi-cyclic Codes over
$GF(7)$
R. Daskalov
,
P. Khristov
Abstract:
Let
$[n,k,d]_q$
codes be linear codes of length
$n$
, dimension
$k$
, and minimum Hamming distance
$d$
over
$GF(q)$
. In this paper, seventeen new codes are constructed, which improve the known lower bounds on minimum distance.
UDC:
621.391.15
Received:
04.10.2001
Fulltext:
PDF file (336 kB)
References
Cited by
English version:
Problems of Information Transmission, 2002,
38
:1,
50–54
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2026