On Binary/Ternary Error-Correcting Codes with Minimum Distance 4

摘要

We consider error-correcting codes over mixed alphabets with n_2 binary and n_3 ternary coordinates, and denote the maximum cardinality of such a code with minimum distance d by N(n_2, n_3, d). We here study this function for short codes (n_2+n_3 <= 13) and d = 4. A computer-aided method is used to settle 14 values, and bounds for 34 other entries are improved. In the method used, codes are built up from smaller codes using backtracking and isomorphism rejection. Codes of short length are further classified.