Skip to main content
SpringerLink
Log in

Enumeration of Optimal Ternary Constant-Composition Codes

  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Bulgarian Academy of Sciences, Institute of Mathematics and Informatics, Bulgaria

    G. T. Bogdanova

  2. Department of Mathematics, Technical University – Gabrovo, Bulgaria

    S. N. Kapralov

Authors
  1. G. T. Bogdanova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. N. Kapralov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:PRIT.0000011273.98799.a8

Keywords

Search

Navigation