Computer search for binary cyclic UEP codes of odd length up to 65

  • Authors:

  • Mao-Chao Lin;Chi-Chang Lin;Shu Lin

  • Affiliations:

  • Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei;-;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

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