DocumentCode
1379620
Title
Computer search for binary cyclic UEP codes of odd length up to 65
Author
Lin, Mao-Chao ; Lin, Chi-chang ; Lin, Shu
Author_Institution
Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan
Volume
36
Issue
4
fYear
1990
fDate
7/1/1990 12:00:00 AM
Firstpage
924
Lastpage
935
Abstract
Exhaustive computation by a computer was used to find the unequal error protection capabilities of all binary cyclic codes of odd length up to 65 that have minimum distances of at least 3. For those codes for which upper bounds can only be computed on their unequal error protection capabilities, an analytic method developed by V.N. Dynkin and V.A. Togonidze (1976) is used to show that the upper bounds meet the exact unequal error protection capabilities
Keywords
error correction codes; telecommunications computing; binary cyclic codes; computer search; odd length; unequal error protection; upper bounds; Computer errors; Councils; Decoding; Error correction codes; Gas insulated transmission lines; Hamming weight; Linear code; Upper bound; Vectors;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.53760
Filename
53760
Link To Document