New lower bounds for asymmetric and unidirectional codes

New lower bounds on the sizes of asymmetric codes and unidirectional codes are presented. Various methods are used, three of them of special interest. The first is a partitioning method that is a modification of a method used to construct constant weight codes. The second is a combining codes method that is used to obtain a new code from a few others. The third method is shortening by weights that is applied on symmetric codes or on codes generated by the combining codes method. Tables for the sizes of codes of length n >

[1]  Terry J. Wagner,et al.  A Search Technique for Quasi-Perfect Codes , 1966, Inf. Control..

[2]  Akira Shiozaki.  Construction for binary asymmetric error-correcting codes , 1982, IEEE Trans. Inf. Theory.

[3]  Tuvi Etzion,et al.  New lower bounds for constant weight codes , 1989, IEEE Trans. Inf. Theory.

[4]  Bella Bose,et al.  Theory of Unidirectional Error Correcting/Detecting Codes , 1978, IEEE Transactions on Computers.

[5]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[6]  Jos H. Weber,et al.  Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6 , 1988, IEEE Trans. Inf. Theory.

[7]  N. J. A. Sloane,et al.  Lexicographic codes: Error-correcting codes from game theory , 1986, IEEE Trans. Inf. Theory.

[8]  Hideki Imai,et al.  Some new binary codes correcting asymmetric/unidirectional errors , 1990, IEEE Trans. Inf. Theory.

[9]  N. J. A. Sloane,et al.  A new table of constant weight codes , 1990, IEEE Trans. Inf. Theory.

[10]  N. J. A. Sloane,et al.  New binary codes , 1972, IEEE Trans. Inf. Theory.

[11]  Jos H. Weber,et al.  Bounds and constructions for codes correcting unidirectional errors , 1989, IEEE Trans. Inf. Theory.