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 ≤ d ≤ n ≤ 10.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bogdanova, G.T., Kapralov, S.N. Enumeration of Optimal Ternary Constant-Composition Codes. Problems of Information Transmission 39, 346–351 (2003). https://doi.org/10.1023/B:PRIT.0000011273.98799.a8
Issue Date:
DOI: https://doi.org/10.1023/B:PRIT.0000011273.98799.a8