Harry T. Hsu

Learn More
Many data-transmission and data-storage systems are corrupted by disturbances of both the burst type and the random type. In this paper two classes of error-correcting codes for use with these systems have been constructed analytically and with the aid of a computer. Although not optimal, these codes do have the advantage of ease of implementation.
This paper is a study of a large class of cyclic and shortened cyclic binary codes for multiple random error correction. The major result is: If g(x) = 1I~=1 gdx) generates a basic BCH code of length N with minimum weight l >~2lt + 1, then g(x) {II~=l [g~(x)]*J}. zl = [I-Ij=(~+~) gj(x)], where ii > i2 > > ir > 1 generates a shortened cyclic or nonshortened(More)
In this paper, a class of shortened cyclic codes for a compound channel will be presented. This class of cyclic codes can be used for combating noises in a practical channel, where both burst errors and random errors occur. As compared with the results of a previous paper by Hsu, Kasami, and Chien (1968) (henceforward will be referred to as HKC codes), the(More)
  • 1