��

Paper award 36837

1981

Free Synchronous Packet Access in a Broadcast Channel with Feedback

Problemy Peredachi Informatsii

October 1978

Paper award 36836

1981

Tree algorithms for packet broadcast channels

�� Transactions on Information Theory

September 1979

Paper award 36835

1980

On the Shannon capacity of a graph

�� Transactions on Information Theory

January 1979

Paper award 36834

1979

A universal algorithm for sequential data compression

�� Transactions on Information Theory

May 1977

Paper award 36833

1978

On Digital Signatures and Public-Key Cryptosystems

Technical Memo

April 1977

Paper award 36832

1978

New directions in cryptography

�� Transactions on Information Theory

November 1976

Paper award 36831

1977

The rate-distortion function for source coding with side information at the decoder

�� Transactions on Information Theory

January 1976

Paper award 36830

1975

Noiseless coding of correlated information sources

�� Transactions on Information Theory

July 1973

Paper award 36829

1974

Computation of channel capacity and rate-distortion functions

�� Transactions on Information Theory

July 1972

Paper award 36828

1974

An algorithm for computing the capacity of arbitrary discrete memoryless channels

�� Transactions on Information Theory

January 1972