A new single asymmetric error-correcting code is proposed. This code is constructed using a product of two codes of smaller dimensions. The proposed code is of dimension 17 and of size 8192, i.e., with 2/sup 13/ codewords. The best known code of dimension 17 has size 7968 and capable of handling 12 information bits only. The only other three known cases of single asymmetric codes accommodating one more extra information bit than the symmetric case are for code dimensions 2, 4, and 16.

New single asymmetric error-correcting codes are proposed. These codes are better than existing codes when the code length n is greater than 10, except for n=12 and n=15. In many cases one can construct a code C containing at least [2/sup n//n] codewords. It is known that a code with |C|/spl ges/[2/sup n//(n+1)] can be easily obtained. It should be noted that the proposed codes for n=12 and n=15 are also the best known codes that can be explicitly constructed, since the best of the existing codes for these values of n are based on combinatorial arguments. Useful partitions of binary vectors are also presented.