General information
Latest issue
Impact factor
Guidelines for authors

Search papers
Search references

Latest issue
Current issues
Archive issues
What is RSS

Probl. Peredachi Inf.:

Personal entry:
Save password
Forgotten password?

Probl. Peredachi Inf., 2003, Volume 39, Issue 4, Pages 35–40 (Mi ppi314)  

This article is cited in 17 scientific papers (total in 17 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$.

Full text: PDF file (611 kB)
References: PDF file   HTML file

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

Bibliographic databases:

UDC: 621.391.15
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

Citation in format AMSBIB
\by G.~T.~Bogdanova, S.~N.~Kapralov
\paper Enumeration of Optimal Ternary Constant-Composition
\jour Probl. Peredachi Inf.
\yr 2003
\vol 39
\issue 4
\pages 35--40
\jour Problems Inform. Transmission
\yr 2003
\vol 39
\issue 4
\pages 246--351

Linking options:

    SHARE: FaceBook Twitter Livejournal

    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Ding Cunsheng, Yin Jianxing, “Combinatorial constructions of optimal constant-composition codes”, IEEE Trans. Inform. Theory, 51:10 (2005), 3671–3674  crossref  mathscinet  zmath  isi
    2. Ding Cunsheng, Yin Jianxing, “Algebraic constructions of constant composition codes”, IEEE Trans. Inform. Theory, 51:4 (2005), 1585–1589  crossref  mathscinet  zmath  isi
    3. Chee Yeow Meng, Ling A.C.H., Ling San, Shen Hao, “The PBD-closure of constant-composition codes”, IEEE Trans. Inform. Theory, 53:8 (2007), 2685–2692  crossref  mathscinet  zmath  isi
    4. Ding Cunsheng, “Optimal constant composition codes from zero-difference balanced functions”, IEEE Trans. Inform. Theory, 54:12 (2008), 5766–5770  crossref  mathscinet  zmath  isi
    5. Chee Yeow Meng, Ge Gennian, Ling A.C.H., “Group divisible codes and their application in the construction of optimal constant-composition codes of weight three”, IEEE Trans. Inform. Theory, 54:8 (2008), 3552–3564  crossref  mathscinet  zmath  isi
    6. Li Chao, Li Qiang, Ling San, “On the constructions of constant-composition codes from perfect nonlinear functions”, Sci. China Ser. F, 52:6 (2009), 964–973  crossref  mathscinet  zmath  isi
    7. Wang Ch., Yan J., “Bounds and Constructions on Optimal Constant Composition Codes”, Proceedings of the 2009 2nd International Congress on Image and Signal Processing, 2009, 178–180  isi
    8. Chee Yeow Meng, Dau Son Hoang, Ling A.C.H., Ling San, “Linear size optimal $q$-ary constant-weight codes and constant-composition codes”, IEEE Trans. Inform. Theory, 56:1 (2010), 140–151  crossref  mathscinet  isi
    9. Gao F., Ge G., “Optimal Ternary Constant-Composition Codes of Weight Four and Distance Five”, IEEE Trans Inform Theory, 57:6 (2011), 3742–3757  crossref  mathscinet  isi
    10. Bogdanova G.T., Todorov T.J., Todorov V.H., “QPlus: computer package for coding theory research and education”, Int J Comput Math, 88:3 (2011), 443–451  crossref  zmath  isi  elib
    11. Zhu M., Ge G., “4-Gdd(6N)S and Related Optimal Quaternary Constant-Weight Codes”, J. Comb Des., 20:12 (2012), 509–526  crossref  mathscinet  zmath  isi
    12. Zhu M., Ge G., “Quaternary Constant-Composition Codes with Weight 4 and Distances 5 Or 6”, IEEE Trans. Inf. Theory, 58:9 (2012), 6012–6022  crossref  mathscinet  isi
    13. Zhu M., Ge G., “Room Squares With Super-Simple Property”, Des. Codes Cryptogr., 71:3 (2014), 365–381  crossref  mathscinet  zmath  isi
    14. Wei H., Zhang H., Zhu M., Ge G., “Optimal Ternary Constant-Composition Codes With Weight Four and Distance Six”, Discrete Math., 338:3 (2015), 72–87  crossref  mathscinet  zmath  isi
    15. Liu B., Li X., Cheng F., “Two Classes of Optimal Constant Composition Codes From Zero Difference Balanced Functions”, IEICE Trans. Fundam. Electron. Commun. Comput. Sci., E100A:10 (2017), 2183–2186  crossref  isi  scopus
    16. Su W., “Two Classes of New Zero Difference Balanced Functions From Difference Balanced Functions and Perfect Ternary Sequences”, IEICE Trans. Fundam. Electron. Commun. Comput. Sci., E100A:3 (2017), 839–845  crossref  isi  scopus
    17. Chee Y.M., Zhang X., “Linear Size Constant-Composition Codes Meeting the Johnson Bound”, IEEE Trans. Inf. Theory, 64:2 (2018), 909–917  crossref  mathscinet  zmath  isi  scopus
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:271
    Full text:85
    First page:1

    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020