Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6
Jos H. Weber, C. de Vroedt, Dick E. Boekee · IEEE Transactions on Information Theory · 1988
Upper bounds to the maximum number of codewords in a binary code of length n and asymmetric distance Delta are derived for some values of n and Delta . A method is given in which a code of length n-m and asymmetric distance at least t+1 is constructed by expurgating and puncturing a code of length n and Hamming distance at least 2t+1. Novel asymmetric error-correcting codes are constructed by applying this method to some celebrated symmetric error-correcting codes. a table is presented on the size of optimal asymmetric error-correcting codes of length less than 24 and asymmetric distance less than 6.>