|
Problemy Peredachi Informatsii, 2006, Volume 42, Issue 3, Pages 37–44
(Mi ppi51)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
Coding Theory
The Gray–Rankin
Bound for Nonbinary Codes
L. A. Bassalygoa, S. M. Dodunekovb, V. A. Zinov'eva, T. Hellesethc a Institute for Information Transmission Problems, Russian Academy of Sciences
b Institute of Mathematics and Informatics, Bulgarian Academy of Sciences
c University of Bergen
Abstract:
The Grey–Rankin bound for nonbinary codes is obtained. Examples of codes
meeting this bound are given.
Received: 28.02.2006 Revised: 28.04.2006
Citation:
L. A. Bassalygo, S. M. Dodunekov, V. A. Zinov'ev, T. Helleseth, “The Gray–Rankin
Bound for Nonbinary Codes”, Probl. Peredachi Inf., 42:3 (2006), 37–44; Problems Inform. Transmission, 42:3 (2006), 197–203
Linking options:
https://www.mathnet.ru/eng/ppi51 https://www.mathnet.ru/eng/ppi/v42/i3/p37
|
|