|
Problemy Peredachi Informatsii, 2003, Volume 39, Issue 4, Pages 35–40
(Mi ppi314)
|
|
|
|
This article is cited in 18 scientific papers (total 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$.
Received: 02.07.2002 Revised: 11.07.2003
Citation:
G. T. Bogdanova, S. N. Kapralov, “Enumeration of Optimal Ternary Constant-Composition
Codes”, Probl. Peredachi Inf., 39:4 (2003), 35–40; Problems Inform. Transmission, 39:4 (2003), 246–351
Linking options:
https://www.mathnet.ru/eng/ppi314 https://www.mathnet.ru/eng/ppi/v39/i4/p35
|
Statistics & downloads: |
Abstract page: | 413 | Full-text PDF : | 121 | References: | 57 | First page: | 1 |
|