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
fDate :
7/1/1990 12:00:00 AM
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;
Journal_Title :
Information Theory, IEEE Transactions on
