RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 2006 Volume 42, Issue 3, Pages 37–44 (Mi ppi51)
This article is cited in 7 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.

UDC: 621.391.15

Received: 28.02.2006
Revised: 28.04.2006


 English version: Problems of Information Transmission, 2006, 42:3, 197–203

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024