|Title:||NEW LOWER BOUNDS FOR ASYMMETRIC AND UNIDIRECTIONAL CODES
|Abstract:||We present new lower bounds on the sizes of asymmetric codes and unidirectional codes. We use various methods, three of them are of special interest. The first is the partitioning method which is a generalization of a method used to construct constant weight codes. The second is combining codes method which is used to obtain a new code from a few others. The third method is shortening by weights which is applied on symmetric codes or on codes generated by the combining codes method. We present a table for the sizes of codes of length nS23.
• The author is with the Computer Science Department, Technion, Haifa 3200<l. Israel. The research was supported in part by Technion V.P.R. Fund - Albert Einstein Research Fund. This work was presented at the IEEE International Symposium on Information Theory, San Diego, 1990.
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1990/CS/CS0618), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1990
To the main CS technical reports page
Computer science department, Technion