Harry T. Hsu

According to our database, Harry T. Hsu authored at least 8 papers between 1968 and 1975.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1975

An Algorithm for Finding a Minimal Equivalent Graph of a Digraph.

Harry T. Hsu

J. ACM, 1975

1974

A class of shortened cyclic codes for a compound channel (Corresp.).

Harry T. Hsu

IEEE Trans. Inf. Theory, 1974

1973

On the Decoding of a Class of Shortened Cyclic Codes for a Compound Channel

Harry T. Hsu

Inf. Control., February, 1973

1971

A Class of Binary Shortened Cyclic Codes for a Compound Channel

Harry T. Hsu

Inf. Control., March, 1971

On the reversibility of Iwadare-type-B1 recurrent codes (Corresp.).

Harry T. Hsu

IEEE Trans. Inf. Theory, 1971

1970

A Large Class of Cyclic and Shortened Cyclic Binary Codes for Multiple Error Correction

Harry T. Hsu

Inf. Control., May, 1970

1969

A new class of recurrent codes.

Harry T. Hsu

IEEE Trans. Inf. Theory, 1969

1968

Error-correcting codes for a compound channel.

Harry T. Hsu, Tadao Kasami, Robert T. Chien

IEEE Trans. Inf. Theory, 1968