DocumentCode
851102
Title
New lower bounds for asymmetric and unidirectional codes
Author
Etzion, Tuvi
Author_Institution
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
Volume
37
Issue
6
fYear
1991
fDate
11/1/1991 12:00:00 AM
Firstpage
1696
Lastpage
1704
Abstract
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 ⩽23 are presented
Keywords
error correction codes; asymmetric codes; combining codes method; lower bounds; partitioning method; shortening by weights; unidirectional codes; Algorithms; Convolution; Differential equations; Hamming distance; Integral equations; Linear systems; Markov processes; Nonlinear equations; Queueing analysis; Simultaneous localization and mapping;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.104336
Filename
104336
Link To Document