Eugene R. Rodemich

According to our database, Eugene R. Rodemich authored at least 10 papers between 1971 and 1998.

Collaborative distances:

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

1998

Dense Admissible Sets.

Daniel M. Gordon, Eugene R. Rodemich

Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1992

Performance of binary block codes at low signal-to-noise ratios.

Chi-Chao Chao, Robert J. McEliece, Laif Swanson, Eugene R. Rodemich

IEEE Trans. Inf. Theory, 1992

Real-time combining of residual carrier array signals using ML weight estimates.

Victor A. Vilnrotter, Eugene R. Rodemich, Samuel J. Dolinar Jr.

IEEE Trans. Commun., 1992

1987

The capacity of the Hopfield associative memory.

Robert J. McEliece, Edward C. Posner, Eugene R. Rodemich, Santosh S. Venkatesh

IEEE Trans. Inf. Theory, 1987

1986

An entropy maximization problem related to optical communication.

Robert J. McEliece, Eugene R. Rodemich, Laif Swanson

IEEE Trans. Inf. Theory, 1986

1984

A generalization of the near-optimum binary coherent state receiver concept.

Victor A. Vilnrotter, Eugene R. Rodemich

IEEE Trans. Inf. Theory, 1984

1981

The capacity of the photon counting channel.

John R. Pierce, Edward C. Posner, Eugene R. Rodemich

IEEE Trans. Inf. Theory, 1981

1980

The Constantin-Rao Construction for Binary Assymmetric Error-Correcting Codes

Robert J. McEliece, Eugene R. Rodemich

Inf. Control., February, 1980

1977

New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities.

Robert J. McEliece, Eugene R. Rodemich, Howard Rumsey Jr., Lloyd R. Welch

IEEE Trans. Inf. Theory, 1977

1971

The processor-sharing queueing model for time-shared systems with bulk arrivals.

Leonard Kleinrock, Richard R. Muntz, Eugene R. Rodemich

Networks, 1971