Bounds on mixed binary/ternary codes
Andries E. Brouwer, Heikki O. Hämäläinen, Patric R. J. Östergård, Neil J.A. Sloane · IEEE Transactions on Information Theory · 1998
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.