|
Problemy Peredachi Informatsii, 2002, Volume 38, Issue 1, Pages 59–63
(Mi ppi1300)
|
|
|
|
This article is cited in 9 scientific papers (total 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.
Received: 04.10.2001
Citation:
R. Daskalov, P. Khristov, “New One-Generator Quasi-cyclic Codes over $GF(7)$”, Probl. Peredachi Inf., 38:1 (2002), 59–63; Problems Inform. Transmission, 38:1 (2002), 50–54
Linking options:
https://www.mathnet.ru/eng/ppi1300 https://www.mathnet.ru/eng/ppi/v38/i1/p59
|
Statistics & downloads: |
Abstract page: | 498 | Full-text PDF : | 252 | References: | 53 |
|