Luther D. Rudolph

According to our database1, Luther D. Rudolph authored at least 17 papers between 1964 and 1988.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1988
Iteratively maximum likelihood decodable spherical codes and a method for their construction.
IEEE Trans. Inf. Theory, 1988

1983
Decoding by local optimization.
IEEE Trans. Inf. Theory, 1983

1980
Dual-Mode Logic for Function-Independent Fault Testing.
IEEE Trans. Computers, 1980

1979
Algebraic analog decoding of linear binary codes.
IEEE Trans. Inf. Theory, 1979

1977
Asymptotic performance of optimum bit-by-bit decoding for the white Gaussian channel (Corresp.).
IEEE Trans. Inf. Theory, 1977

1976
An optimum symbol-by-symbol decoding rule for linear codes.
IEEE Trans. Inf. Theory, 1976

1974
Majority decoding of some classes of binary cyclic codes.
IEEE Trans. Inf. Theory, 1974

On the structure of generalized finite-geometry codes.
IEEE Trans. Inf. Theory, 1974

On Two-Level Exclusive-or Majority Networks.
IEEE Trans. Computers, 1974

1973
Decoding by sequential code reduction.
IEEE Trans. Inf. Theory, 1973

1972
One-step weighted-majority decoding (Corresp.).
IEEE Trans. Inf. Theory, 1972

A Relationship Between Output Symbol Occurrence Rate and Observability of Autonomous Machines.
IEEE Trans. Computers, 1972

1970
Generalized threshold decoding of convolutional codes.
IEEE Trans. Inf. Theory, 1970

A note on the free distance of a convolutional code (Corresp.).
IEEE Trans. Inf. Theory, 1970

1969
Threshold decoding of cyclic codes.
IEEE Trans. Inf. Theory, 1969

1967
A class of majority logic decodable codes (Corresp.).
IEEE Trans. Inf. Theory, 1967

1964
Implementation of decoders for cyclic codes (Corresp.).
IEEE Trans. Inf. Theory, 1964


  Loading...