Eugene R. Rodemich - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 10 from 10

1998

Dense Admissible SetsDaniel M. Gordon, Eugene R. Rodemich. antsw 1998: 216-225 [doi]

1992

Performance of binary block codes at low signal-to-noise ratiosChi-Chao Chao, Robert J. McEliece, Laif Swanson, Eugene R. Rodemich. TIT, 38(6):1677-1687, 1992.

Real-time combining of residual carrier array signals using ML weight estimatesVictor A. Vilnrotter, Eugene R. Rodemich, Samuel J. Dolinar Jr.. tcom, 40(3):604-615, 1992. [doi]

1987

The capacity of the Hopfield associative memoryRobert J. McEliece, Edward C. Posner, Eugene R. Rodemich, Santosh S. Venkatesh. TIT, 33(4):461-482, 1987.

1986

An entropy maximization problem related to optical communicationRobert J. McEliece, Eugene R. Rodemich, Laif Swanson. TIT, 32(2):322, 1986.

1984

A generalization of the near-optimum binary coherent state receiver conceptVictor A. Vilnrotter, Eugene R. Rodemich. TIT, 30(2):446, 1984.

1981

The capacity of the photon counting channelJohn R. Pierce, Edward C. Posner, Eugene R. Rodemich. TIT, 27(1):61-76, 1981.

1980

The Constantin-Rao Construction for Binary Assymmetric Error-Correcting CodesRobert J. McEliece, Eugene R. Rodemich. iandc, 44(2):187-196, February 1980.

1977

New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesRobert J. McEliece, Eugene R. Rodemich, Howard Rumsey Jr., Lloyd R. Welch. TIT, 23(2):157-166, 1977. [doi]

1971

The processor-sharing queueing model for time-shared systems with bulk arrivalsLeonard Kleinrock, Richard R. Muntz, Eugene R. Rodemich. networks, 1(1):1-13, 1971. [doi]

Sign in or sign up to see more results.

runs on WebDSL