|
Problemy Peredachi Informatsii, 1984, Volume 20, Issue 4, Pages 11–22
(Mi ppi1152)
|
|
|
|
This article is cited in 20 scientific papers (total in 20 papers)
Coding Theory
Minimum Block Length of a Linear $q$-ary Code with Specified Dimension and Code Distance
S. M. Dodunekov
Abstract:
The article considers the determination of the minimum possible length of a linear code with specified dimension and code distance over a field of $q$ elements. Constructions of minimum-length codes are given, and their properties are investigated. Some refinements of the Griesmer bound are given.
Received: 16.05.1983
Citation:
S. M. Dodunekov, “Minimum Block Length of a Linear $q$-ary Code with Specified Dimension and Code Distance”, Probl. Peredachi Inf., 20:4 (1984), 11–22; Problems Inform. Transmission, 20:4 (1984), 239–249
Linking options:
https://www.mathnet.ru/eng/ppi1152 https://www.mathnet.ru/eng/ppi/v20/i4/p11
|
Statistics & downloads: |
Abstract page: | 397 | Full-text PDF : | 175 |
|