Bounds on mixed binary/ternary codes

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

Research output: Contribution to journalArticleAcademicpeer-review

60 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)140-161
JournalIEEE Transactions on Information Theory
Issue number1
Publication statusPublished - 1998


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

Cite this