RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 2003 Volume 39, Issue 4, Pages 35–40 (Mi ppi314)
This article is cited in 18 papers

Information Theory and Coding Theory

Enumeration of Optimal Ternary Constant-Composition Codes

G. T. Bogdanovaa, S. N. Kapralovb

a Institute of Mathematics and Informatics, Bulgarian Academy of Sciences
b Technical University of Gabrovo

Abstract: The problem of classification of optimal ternary constant-composition codes is considered. Using a combinatorial-computer method, the number of inequivalent codes is determined for $3\leq d\leq n\leq10$.

UDC: 621.391.15

Received: 02.07.2002
Revised: 11.07.2003


 English version: Problems of Information Transmission, 2003, 39:4, 246–351

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024