The processor-sharing queueing model for time-shared systems with bulk arrivals. - Leonard Kleinrock; Richard R. Muntz; Eugene R. Rodemich (Networks, 1971)

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)

The Constantin-Rao Construction for Binary Assymmetric Error-Correcting Codes - Robert J. McEliece; Eugene R. Rodemich (Inf. Control., 1980)

The capacity of the photon counting channel. - John R. Pierce; Edward C. Posner; Eugene R. Rodemich (IEEE Trans. Inf. Theory, 1981)

A generalization of the near-optimum binary coherent state receiver concept. - Victor A. Vilnrotter; Eugene R. Rodemich (IEEE Trans. Inf. Theory, 1984)

An entropy maximization problem related to optical communication. - Robert J. McEliece; Eugene R. Rodemich; Laif Swanson (IEEE Trans. Inf. Theory, 1986)

The capacity of the Hopfield associative memory. - Robert J. McEliece; Edward C. Posner; Eugene R. Rodemich; Santosh S. Venkatesh (IEEE Trans. Inf. Theory, 1987)

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)

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)

Dense Admissible Sets. - Daniel M. Gordon; Eugene R. Rodemich (ANTS, 1998)