NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Computer search for binary cyclic UEP codes of odd length up to 65Using an exhaustive computation, the unequal error protection capabilities of all binary cyclic codes of odd length up to 65 that have minimum distances at least 3 are found. For those codes that can only have upper bounds on their unequal error protection capabilities computed, an analytic method developed by Dynkin and Togonidze (1976) is used to show that the upper bounds meet the exact unequal error protection capabilities.
Document ID
19910048585
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
External Source(s)
Authors
Lin, Mao-Chao
(National Taiwan Univ. Taipei, Taiwan, Province Of China)
Lin, Chi-Chang
(National Taiwan University Taipei, Republic of China, United States)
Lin, Shu
(Hawaii, University Honolulu, United States)
Date Acquired
August 14, 2013
Publication Date
July 1, 1990
Publication Information
Publication: IEEE Transactions on Information Theory
Volume: 36
ISSN: 0018-9448
Subject Category
Cybernetics
Accession Number
91A33208
Funding Number(s)
CONTRACT_GRANT: NAG5-931
CONTRACT_GRANT: NSF NCR-88-13480
CONTRACT_GRANT: NSC-77-0404-E002-13
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available