|
|
 |
|
|
|
|
The articles gathered here have been compiled from
various sources, including lectures delivered by Shannon Award winners
and plenary speakers at the IT Symposia, articles written by authors
of
Prize Papers as well as articles specially written for the IT Newsletter.
- "History
of Source Coding"
John C. Kieffer
- "Portfolio
Theory, Erasure-Burst-Correcting Convolutional Codes, Reed-Solomon
Decoding Algorithm and Games" (postscript)
Elwyn
Berlekamp
- "Performance
and Complexity" (pdf)
G. David Forney
- "Symbolic
Dynamics and Coding Applications" (pdf)
Brian Marcus
- "Binary
Trees for Classification, Regression, and Clustering"
(postscript)
Richard A.
Olshen
- "Decoding
Algebraic-Geometric Codes up to the Designed Minimum Distance"
Gui-Liang Feng and T. R. N. Rao.
- "Universal
Prediction of Individual Sequences'' Meir Feder, Neri Merhav and Michael
Gutman
- "Shannon
Theory: Present and Future"
a discussion moderated by Sergio Verdú,
- ``The
Context-Tree Weighting Method: Basic Properties'' (pdf)
Frans Willems, Yuri Shtarkov, and Tjalling Tjalkens
- "Typical
Sequences and All That,: Entropy, Pattern Matching and Data Compression"
(postscript)
Aaron Wyner
- "Back
from Infinity: A Constrained Resources Approach to Information
Theory"
J. Ziv
- "Information
Theoretic Methods in Probability and Statistics" (pdf)
I. Csiszar
- "The
Way to the Proof of Fermat 's Last Theorem"
Gerhard Frey
- "Near
optimum error-correcting coding and decoding: turbo codes"
Claude Berrou and Alain Glavieux
- "The
Sphere Packing Problem"
N. J. A. Sloane
- "From
Matched Filters to Martingales"
Thomas Kailath
|
|
|
|
|
