Bounds on mixed binary/ternary codes

A.E. Brouwer, Heikki O. Hämäläinen, P.R.J Östergård, N.J.A Sloane

    Research output: Contribution to journalArticleScientificpeer-review


    Upper and lower bounds are presented for the maximal possible size of mixed binary/ternary error-correcting codes. A table up to length 13 is included. The upper bounds are obtained by applying the linear programming bound to the product of two association schemes. The lower bounds arise from a number of different constructions. Index Terms- Binary codes, clique finding, linear programming bound, mixed codes, tabu search, ternary codes.
    Original languageEnglish
    Pages (from-to)140-161
    JournalIEEE Transactions on Information Theory
    Issue number1
    Publication statusPublished - 1998
    MoE publication typeA1 Journal article-refereed


    • clique finding
    • error-correcting code
    • linear programming bound
    • tabu search


    Dive into the research topics of 'Bounds on mixed binary/ternary codes'. Together they form a unique fingerprint.

    Cite this