|
Problemy Peredachi Informatsii, 1975, Volume 11, Issue 3, Pages 14–20
(Mi ppi1591)
|
|
|
|
Coding Theory
An Upper Bound on the Volume of $q$-ary Codes
V. R. Sidorenko
Abstract:
An analog of Sidel'nikov's lemma [Probl. Inf. Trans., 1974, vol. 10, no. 2, pp. 124–131] is obtained for $q$-ary codes with a specified vector composition. Upper bounds are obtained for the volume of codes with a specified vector composition and for arbitrary codes. An upper bound is obtained for the exponent of the volume of an arbitrary $q$-ary code that is uniformly superior to the Elias bound.
Received: 27.03.1974 Revised: 10.02.1975
Citation:
V. R. Sidorenko, “An Upper Bound on the Volume of $q$-ary Codes”, Probl. Peredachi Inf., 11:3 (1975), 14–20; Problems Inform. Transmission, 11:3 (1975), 190–194
Linking options:
https://www.mathnet.ru/eng/ppi1591 https://www.mathnet.ru/eng/ppi/v11/i3/p14
|
|