�鶹��ýAV

Paper award 36805

1976

Source Coding Theorems without the Ergodic Assumption

�鶹��ýAV Transactions on Information Theory

July 1974

Paper award 36804

1970

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

�鶹��ýAV Transactions on Information Theory

March 1968

Paper award 36803

1995

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

�鶹��ýAV Transactions on Information Theory

March 1994

Paper award 36802

1997

Near optimum error correcting coding and decoding: turbo-codes

�鶹��ýAV Transactions on Communications

October 1996

Paper award 36801

1996

The context-tree weighting method: basic properties

�鶹��ýAV Transactions on Information Theory

May 1995

Paper award 36800

1994

Decoding algebraic-geometric codes up to the designed minimum distance

�鶹��ýAV Transactions on Information Theory

January 1993

Paper award 36799

1987

Lexicographic codes: Error-correcting codes from game theory

�鶹��ýAV Transactions on Information Theory

May 1986

Paper award 36798

1986

Universal coding, information, prediction, and estimation

�鶹��ýAV Transactions on Information Theory

July 1984

Paper award 36860

2000

Iterative (Turbo) Soft Interference Cancellation and Decoding for Coded CDMA

�鶹��ýAV Transactions on Communications

July 1999

Paper award 36797

1998

Bits Through Queues

�鶹��ýAV Transactions on Information Theory

January 1996