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.
No takes yet. Share an insight, caveat, or question.
Brouwer et al. (1998) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: