�ۿ۴�ý

Paper award 36809

1991

Construction and decoding of a class of algebraic geometry codes

�ۿ۴�ý Transactions on Information Theory

July 1989

Paper award 36808

1992

Matched spectral-null codes for partial-response channels

�ۿ۴�ý Transactions on Information Theory

May 1991

Paper award 36807

1993

Universal prediction of individual sequences

�ۿ۴�ý Transactions on Information Theory

July 1992

Paper award 36806

1976

The Ergodic Decomposition of Stationary Discrete Random Processes

�ۿ۴�ý Transactions on Information Theory

September 1974

Paper award 36805

1976

Source Coding Theorems without the Ergodic Assumption

�ۿ۴�ý Transactions on Information Theory

July 1974

Paper award 36804

1970

Exponential error bounds for erasure, list, and decision feedback schemes

�ۿ۴�ý Transactions on Information Theory

March 1968

Paper award 36803

1995

The Z4-linearity of Kerdock, Preparata, Goethals, andrelated codes

�ۿ۴�ý Transactions on Information Theory

March 1994

Paper award 36802

1997

Near optimum error correcting coding and decoding: turbo-codes

�ۿ۴�ý Transactions on Communications

October 1996

Paper award 36801

1996

The context-tree weighting method: basic properties

�ۿ۴�ý Transactions on Information Theory

May 1995

Paper award 36800

1994

Decoding algebraic-geometric codes up to the designed minimum distance

�ۿ۴�ý Transactions on Information Theory

January 1993