Genetic algorithms in coding theory: a table for A3(n,d)
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Bounds on mixed binary/ternary codes
IEEE Transactions on Information Theory
Optimal binary one-error-correcting codes of length 10 have 72 codewords
IEEE Transactions on Information Theory
Error correcting coding for a nonsymmetric ternary channel
IEEE Transactions on Information Theory
Hi-index | 0.06 |
We consider error-correcting codes over mixed alphabets with n2 binary and n3 ternary coordinates, and denote the maximum cardinality of such a code with minimum distance d by N(n2, n3, d). We here study this function for short codes (n2+n3 ≤ 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.