RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2007 Volume 43, Issue 4, Pages 13–36 (Mi ppi24)

This article is cited in 10 papers

Coding Theory

On the Construction of $q$-ary Equidistant Codes

G. T. Bogdanovaa, V. A. Zinov'evb, T. J. Todorova

a Institute of Mathematics and Informatics, Bulgarian Academy of Sciences
b A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences

Abstract: The problem of constructing equidistant codes over an alphabet of an arbitrary size $q$ is considered. Some combinatorial constructions and computer-based search methods are presented. All maximal equidistant codes with distances 3 and 4 are found.

UDC: 621.391.15

Received: 19.12.2006
Revised: 03.10.2007


 English version:
Problems of Information Transmission, 2007, 43:4, 280–302

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024