\begin{thebibliography}{100}

\bibitem{abramson-book}
N.M. Abramson.
\newblock {\em Information Theory and Coding}.
\newblock McGraw-Hill, New York, 1963.

\bibitem{adler-coppersmith-hassner-symb}
R.L. Adler, D.~Coppersmith, and M.~Hassner.
\newblock Algorithms for sliding block codes --- an application of symbolic
  dynamics to information theory.
\newblock {\em IEEE Trans. Inform. Theory}, IT-29(1):5--22, 1983.

\bibitem{ahlswede-multipleaccess}
R~Ahlswede.
\newblock Multi-way communication channels.
\newblock In {\em Proc. 2nd. Int. Symp. Information Theory (Tsahkadsor,
  Armenian S.S.R.)}, pages 23--52. Publishing House of the Hungarian Academy of
  Sciences, 1971.

\bibitem{ahlswede-1974}
R.~Ahlswede.
\newblock The capacity region of a channel with two senders and two receivers.
\newblock {\em Ann. Prob.}, 2:805--814, 1974.

\bibitem{ahlswede-1978}
R.~Ahlswede.
\newblock Elimination of correlation in random codes for arbitrarily varying
  channels.
\newblock {\em Zeitschrift f{\"{u}}r Wahrscheinlichkeitstheorie and verwandte
  Gebiete}, 33:159--175, 1978.

\bibitem{ahlswede-han-1983}
R.~Ahlswede and T.S. Han.
\newblock On source coding with side information via a multiple access channel
  and related problems in multi-user information theory.
\newblock {\em IEEE Trans. Inform. Theory}, IT-29:396--412, 1983.

\bibitem{ahlswede-korner-1975}
R.~Ahlswede and J.~K{\"{o}}rner.
\newblock Source coding with side information and a converse for the degraded
  broadcast channel.
\newblock {\em IEEE Trans. Inform. Theory}, IT-21:629--637, 1975.

\bibitem{algoet-cover-aep}
P.~Algoet and T.~M. Cover.
\newblock A sandwich proof of the {S}hannon-{M}c{M}illan-{B}reiman theorem.
\newblock {\em Annals of Probability}, 16(2):899--909, 1988.

\bibitem{algoet-cover-1988}
P.~Algoet and T.M. Cover.
\newblock Asymptotic optimality and asymptotic equipartition property of
  log-optimal investment.
\newblock {\em Ann. Prob.}, 16(2):876--898, 1988.

\bibitem{amari-book}
S.~Amari.
\newblock {\em Differential-geometrical methods in statistics}.
\newblock Springer-Verlag, New York, 1985.

\bibitem{arimoto-1972}
S.~Arimoto.
\newblock An algorithm for calculating the capacity of an arbitrary discrete
  memoryless channel.
\newblock {\em IEEE Trans. Inform. Theory}, IT-18:14--20, 1972.

\bibitem{arimoto-1973-conv}
S.~Arimoto.
\newblock On the converse to the coding theorem for discrete memoryless
  channels.
\newblock {\em IEEE Trans. Inform. Theory}, IT-19:357--359, 1973.

\bibitem{ash-book}
R.B. Ash.
\newblock {\em Information Theory}.
\newblock Interscience, New York, 1965.

\bibitem{aczel-daroczy-book}
J.~Axz{\'{e}}l and Z.~Dar{\'{o}}czy.
\newblock {\em On Measures of Information and their Characterization}.
\newblock Academic Press, New York, 1975.

\bibitem{barron-centrallimit}
A.~Barron.
\newblock Entropy and the central limit theorem.
\newblock {\em The Annals of Probability}, 14(1):336--342, 1986.

\bibitem{cover-barron-1988}
A.~Barron and T.M. Cover.
\newblock A bound on the financial value of information.
\newblock {\em IEEE Trans. Inform. Theory}, IT-34:1097--1100, 1988.

\bibitem{barron-thesis}
A.~R. Barron.
\newblock {\em Logically smooth density estimation}.
\newblock PhD thesis, Department of Electrical Engineering, Stanford
  University, 1985.

\bibitem{barron-aep}
A.~R. Barron.
\newblock The strong ergodic theorem for densities: {G}eneralized
  {S}hannon-{M}c{M}illan-{B}reiman theorem.
\newblock {\em Annals of Probability}, 13:1292--1303, 1985.

\bibitem{beckner-1975}
W.~Beckner.
\newblock Inequalities in {F}ourier analysis.
\newblock {\em Annals of Mathematics}, 102:159--182, 1975.

\bibitem{bell-cover-1980}
R.~Bell and T.M. Cover.
\newblock Competitive optimality of logarithmic investment.
\newblock {\em Mathematics of Operations Research}, 5(2):161--166, May 1980.

\bibitem{bell-cover-1988}
R.~Bell and T.M. Cover.
\newblock Game-theoretic optimal portfolios.
\newblock {\em Management Science}, 34(6):724--733, 1988.

\bibitem{bell-cleary-witten-book}
T.C. Bell, J.G. Cleary, and I.H. Witten.
\newblock {\em Text Compression}.
\newblock Prentice Hall, Englewood Cliffs, N.J., 1990.

\bibitem{bellman-1955}
R.~Bellman.
\newblock Notes on matrix theory---{IV}: An inequality due to {B}ergstr{\o}m.
\newblock {\em Am. Math. Monthly}, 62:172--173, 1955.

\bibitem{bennet-scientam}
C.H. Bennett.
\newblock Demons, engines and the second law.
\newblock {\em Scientific American}, 259(5):108--116, November 1987.

\bibitem{bennet-landauer-scientam}
C.H. Bennett and R.~Landauer.
\newblock The fundamental physical limits of computation.
\newblock {\em Scientific American}, 255(1):48--56, July 1985.

\bibitem{benzel-1979}
R.~Benzel.
\newblock The capacity region of a class of discrete additive degraded
  interference channels.
\newblock {\em IEEE Trans. Inform. Theory}, IT-25:228--231, 1979.

\bibitem{berger-1971}
T.~Berger.
\newblock {\em Rate Distortion Theory: A Mathematical Basis for Data
  Compression}.
\newblock Prentice-Hall, Englewood Cliffs, N.J., 1971.

\bibitem{berger-1977}
T.~Berger.
\newblock Multiterminal source coding.
\newblock In G.~Longo, editor, {\em The Information Theory Approach to
  Communications}. Springer-Verlag, New York, 1977.

\bibitem{berger-1977a}
T.~Berger.
\newblock Multiterminal source coding.
\newblock In {\em Lecture notes presented at the 1977 CISM Summer School,
  Udine, Italy}, July 18-20 1977.

\bibitem{berger-yeung-1989}
T.~Berger and R.W. Yeung.
\newblock Multiterminal source encoding with one distortion criterion.
\newblock {\em IEEE Trans. Inform. Theory}, IT-35:228--236, 1989.

\bibitem{bergmans-1973}
P.~Bergmans.
\newblock Random coding theorem for broadcast channels with degraded
  components.
\newblock {\em IEEE Trans. Inform. Theory}, IT-19:197--207, 1973.

\bibitem{berlekamp-thesis}
E.R. Berlekamp.
\newblock {\em Block Coding with Noiseless Feedback}.
\newblock PhD thesis, MIT, Cambridge, MA, 1964.

\bibitem{bierbaum-wallmeier-1979}
M.~Bierbaum and H.M. Wallmeier.
\newblock A note on the capacity region of the multiple access channel.
\newblock {\em IEEE Trans. Inform. Theory}, IT-25:484, 1979.

\bibitem{blachman-1965}
N.~Blachman.
\newblock The convolution inequality for entropy powers.
\newblock {\em IEEE Trans. Inform. Theory}, IT-11:267--271, April 1965.

\bibitem{blackwell-breiman-thomasian-1959}
D.~Blackwell, L.~Breiman, and A.J. Thomasian.
\newblock The capacity of a class of channels.
\newblock {\em Ann. Math. Stat.}, 30:1229--1241, 1959.

\bibitem{blackwell-breiman-thomasian-1960}
D.~Blackwell, L.~Breiman, and A.J. Thomasian.
\newblock The capacities of certain channel classes under random coding.
\newblock {\em Ann. Math. Stat.}, 31:558--567, 1960.

\bibitem{blahut-1972}
R.~Blahut.
\newblock Computation of channel capacity and rate distortion functions.
\newblock {\em IEEE Trans. Inform. Theory}, IT-18:460--473, 1972.

\bibitem{blahut-1976}
R.~E. Blahut.
\newblock Information bounds of the {F}ano-{K}ullback type.
\newblock {\em IEEE Trans. Inform. Theory}, IT-22:410--421, 1976.

\bibitem{blahut-book}
R.~E. Blahut.
\newblock {\em Principles and Practice of Information Theory}.
\newblock Addison-Wesley, 1987.

\bibitem{blahut-1974}
R.E. Blahut.
\newblock Hypothesis testing and information theory.
\newblock {\em IEEE Trans. Inform. Theory}, IT-20:405--417, 1974.

\bibitem{blahut-codingtheorybook}
R.E. Blahut.
\newblock {\em Theory and Practice of Error Control Codes}.
\newblock Addison-Wesley, Reading, Massachusetts, 1983.

\bibitem{bose-chaudhuri}
R.C. Bose and D.K. Ray-{C}haudhuri.
\newblock On a class of error correcting binary group codes.
\newblock {\em Information and Control}, 3:68--79, March 1960.

\bibitem{brascamp-lieb-1976}
H.J. Brascamp and E.J. Lieb.
\newblock Best constants in {Y}oung's inequality, its converse and its
  generalization to more than three functions.
\newblock {\em Advances in Mathematics}, 20:151--173, 1976.

\bibitem{breiman-aep}
L.~Breiman.
\newblock The individual ergodic theorems of information theory.
\newblock {\em Ann. Math. Stat.}, 28:809--811, 1957.
\newblock With correction made in 31:809-810.

\bibitem{breiman-1961}
L.~Breiman.
\newblock Optimal gambling systems for favourable games.
\newblock In {\em Fourth Berkeley Symposium on Mathematical Statistics and
  Probability}, volume~1, pages 65--78. Univ. Calif. Press, Berkeley, CA.,
  1961.

\bibitem{brillouin-thermo}
Leon Brillouin.
\newblock {\em Science and Information Theory}.
\newblock Academic Press, 1962.

\bibitem{burg-1975}
J.P. Burg.
\newblock {\em Maximum entropy spectral analysis}.
\newblock PhD thesis, Department of Geophysics, Stanford University, Stanford,
  Calif., 1975.

\bibitem{carleial-1983}
A.~Carleial.
\newblock Outer bounds on the capacity of the interference channel.
\newblock {\em IEEE Trans. Inform. Theory}, IT-29:602--606, 1983.

\bibitem{carleial-1975}
A.B. Carleial.
\newblock A case where interference does not reduce capacity.
\newblock {\em IEEE Trans. Inform. Theory}, IT-21:569--570, 1975.

\bibitem{chaitin-1966}
G.J. Chaitin.
\newblock On the length of programs for computing binary sequences.
\newblock {\em J.Assoc.Comp. Mach.}, 13:547--569, 1966.

\bibitem{chaitin-1974}
G.J. Chaitin.
\newblock Information theoretical limitations of formal systems.
\newblock {\em J. Assoc. Comp. Mach.}, 21:403--424, 1974.

\bibitem{chaitin-1975-scam}
G.J. Chaitin.
\newblock Randomness and mathematical proof.
\newblock {\em Scientific American}, 232(5):47--52, May 1975.

\bibitem{chaitin-1977}
G.J. Chaitin.
\newblock Algorithmic information theory.
\newblock {\em IBM Journal of Research and Development}, 21:350--359, 1977.

\bibitem{chaitin-book}
G.J. Chaitin.
\newblock {\em Algorithmic Information Theory}.
\newblock Cambridge University Press, Cambridge, 1987.

\bibitem{chernoff-1952}
H.~Chernoff.
\newblock A measure of the asymptotic efficiency of tests of a hypothesis based
  on a sum of observations.
\newblock {\em Ann. Math. Stat.}, 23:493--507, 1952.

\bibitem{choi-cover-1984}
B.S. Choi and T.M. Cover.
\newblock An information-theoretic proof of {B}urg's maximum entropy spectrum.
\newblock {\em Proc. IEEE}, 72:1094--1095, 1984.

\bibitem{chung-aep}
K.L. Chung.
\newblock A note on the ergodic theorem of information theory.
\newblock {\em Ann. Math. Statist.}, 32:612--614, 1961.

\bibitem{costa-cover-1984}
M.~Costa and T.M. Cover.
\newblock On the similarity of the entropy power inequality and the
  {B}runn-{M}inkowski inequality.
\newblock {\em IEEE Trans. Inform. Theory}, IT-30:837--839, 1984.

\bibitem{cover-thomas-det}
T.~M. Cover and J.~A. Thomas.
\newblock Determinant inequalities via information theory.
\newblock {\em SIAM Journal of Matrix Analysis and its Applications},
  9(3):384--392, July 1988.

\bibitem{cover-broadcast}
T.M. Cover.
\newblock Broadcast channels.
\newblock {\em IEEE Trans. Inform. Theory}, IT-18:2--14, 1972.

\bibitem{cover-enumerative}
T.M. Cover.
\newblock Enumerative source encoding.
\newblock {\em IEEE Trans. Inform. Theory}, IT-19(1):73--77, January 1973.

\bibitem{cover-1975}
T.M. Cover.
\newblock An achievable rate region for the broadcast channel.
\newblock {\em IEEE Trans. Inform. Theory}, IT-21:399--404, 1975.

\bibitem{cover-slepianwolf}
T.M. Cover.
\newblock A proof of the data compression theorem of {S}lepian and {W}olf for
  ergodic sources.
\newblock {\em IEEE Trans. Inform. Theory}, IT-22:226--228, 1975.

\bibitem{cover-stockmarket-1984}
T.M. Cover.
\newblock An algorithm for maximizing expected log investment return.
\newblock {\em IEEE Trans. Inform. Theory}, IT-30(2):369--373, 1984.

\bibitem{cover-kolmogorov-1985}
T.M. Cover.
\newblock Kolmogorov complexity, data compression and inference.
\newblock In J.~Skwirzynski, editor, {\em The Impact of Processing Techniques
  on Communications}, volume~91 of {\em E: Applied Sciences}. Martinus-Nijhoff
  Publishers, Dodrecht, 1985.

\bibitem{cover-univport}
T.M. Cover.
\newblock Universal portfolios.
\newblock {\em Math. Finance}, January 1991.
\newblock To appear.

\bibitem{cover-elgamal-relay}
T.M. Cover and A~El~Gamal.
\newblock Capacity theorems for the relay channel.
\newblock {\em IEEE Trans. Inform. Theory}, IT-25:572--584, 1979.

\bibitem{cover-elgamal-hadamard}
T.M. Cover and A.~El~Gamal.
\newblock An information theoretic proof of {H}adamard's inequality.
\newblock {\em IEEE Trans. Inform. Theory}, IT-29(6):930--931, November 1983.

\bibitem{cover-elgamal-salehi-1980}
T.M. Cover, A.~El~Gamal, and M.~Salehi.
\newblock Multiple access channels with arbtirarily correlated sources.
\newblock {\em IEEE Trans. Inform. Theory}, IT-26:648--657, 1980.

\bibitem{cover-gacs-gray-1990}
T.M. Cover, P.~G\'acs, and R.M. Gray.
\newblock Kolmogorov's contributions to information theory and algorithmic
  complexity.
\newblock {\em Annals of Prob.}, June 1990.

\bibitem{cover-gopinath-book}
T.M. Cover and B.~Gopinath.
\newblock {\em Open Problems in Communication and Computation}.
\newblock Springer-Verlag, New York, 1987.

\bibitem{cover-king-1978}
T.M. Cover and R.~King.
\newblock A convergent gambling estimate of the entropy of {E}nglish.
\newblock {\em IEEE Trans. Inform. Theory}, IT-24:413--421, 1978.

\bibitem{cover-leung-1981}
T.M. Cover and C.S.K. Leung.
\newblock An achievable rate region for the multiple access channel with
  feedback.
\newblock {\em IEEE Trans. Inform. Theory}, IT-27:292--298, 1981.

\bibitem{cover-leung-1978}
T.M. Cover and S.K. Leung.
\newblock Some equivalences between {S}hannon entropy and {K}olmogorov
  complexity.
\newblock {\em IEEE Trans. Inform. Theory}, IT-24:331--338, 1978.

\bibitem{cover-mceliece-posner-1981}
T.M. Cover, R.J. McEliece, and E.~Posner.
\newblock Asynchronous multiple access channel capacity.
\newblock {\em IEEE Transactions on Infomation Theory}, IT-27:409--413, 1981.

\bibitem{cover-pombra-1989}
T.M. Cover and S.~Pombra.
\newblock {G}aussian feedback capacity.
\newblock {\em IEEE Trans. Inform. Theory}, IT-35:37--43, 1989.

\bibitem{cramer-book}
H.~Cramer.
\newblock {\em Mathematical Methods of Statistics}.
\newblock Princeton University Press, Princeton, NJ, 1946.

\bibitem{csiszar-1967}
I.~Csisz\'{a}r.
\newblock Information type measures of difference of probability distributions
  and indirect observations.
\newblock {\em Studia Sci. Math. Hungar.}, 2:299--318, 1967.

\bibitem{csiszar-1974}
I~Csisz\'{a}r.
\newblock On the computation of rate distortion functions.
\newblock {\em IEEE Trans. Inform. Theory}, IT-20:122--124, 1974.

\bibitem{csiszar-1984}
I~Csisz\'{a}r.
\newblock Sanov property, generalized {I}-projection and a conditional limit
  theorem.
\newblock {\em Annals of Probability}, 12:768--793, 1984.

\bibitem{csiszar-cover-choi-1987}
I.~Csisz\'{a}r, T.M. Cover, and B.S. Choi.
\newblock Conditional limit theorems under {M}arkov conditioning.
\newblock {\em IEEE Trans. Inform. Theory}, IT-33:788--801, 1987.

\bibitem{csiszar-korner-1980}
I.~Csisz{\'{a}}r and J.~K{\"{o}}rner.
\newblock Towards a general theory of source networks.
\newblock {\em IEEE Trans. Inform. Theory}, IT-26:155--165, 1980.

\bibitem{csiszar-korner-book}
I.~Csisz{\'{a}}r and J.~K{\"{o}}rner.
\newblock {\em Information Theory: Coding Theorems for Discrete Memoryless
  Systems}.
\newblock Academic Press, 1981.

\bibitem{csiszar-longo-book}
I.~Csisz{\'{a}}r and G.~Longo.
\newblock {\em On the error exponent for source coding and for testing simple
  statistical hypotheses}.
\newblock Hungarian Academy of Sciences, Budapest, 1971.

\bibitem{csiszar-tusnady-1984}
I.~Csisz\'{a}r and G.~Tusn\'{a}dy.
\newblock Information geometry and alternating minimization procedures.
\newblock {\em Statistics and Decisions}, Supplement Issue 1:205--237, 1984.

\bibitem{davisson-1973}
L.D. Davisson.
\newblock Universal noiseless coding.
\newblock {\em IEEE Trans. Inform. Theory}, IT-19:783--795, 1973.

\bibitem{dembo-epibrunn}
A.~Dembo.
\newblock Information inequalities and uncertainty principles.
\newblock Technical report, Department of Statistics, Stanford University,
  1990.

\bibitem{ref-emalgor}
A.P. Dempster, N.M.Laird, and D.B.Rubin.
\newblock Maximum likelihood from incomplete data via the {EM} algorithm.
\newblock {\em Journal Royal Stat. Soc., Series B}, 39(1):1--38, 1977.

\bibitem{dobrushin-1959}
R.L. Dobrushin.
\newblock General formulation of {S}hannon's main theorem of information
  theory.
\newblock {\em Usp. Math. Nauk.}, 14:3--104, 1959.
\newblock Translated in Am. Math. Soc. Trans., 33:323-438.

\bibitem{dueck-twoway}
G.~Dueck.
\newblock The capacity region of the two-way channel can exceed the inner
  bound.
\newblock {\em Information and Control}, 40:258--266, 1979.

\bibitem{dueck-bcexample}
G.~Dueck.
\newblock Partial feedback for two-way and broadcast channels.
\newblock {\em Inform. Contr.}, 46:1--15, 1980.

\bibitem{dueck-korner-1979}
G.~Dueck and J.~K{\"{o}}rner.
\newblock Reliability function of a discrete memoryless channel at rates above
  capacity.
\newblock {\em IEEE Trans. Inform. Theory}, IT-25:82--85, 1979.

\bibitem{ebert-1970}
P.M. Ebert.
\newblock The capacity of the {G}aussian channel with feedback.
\newblock {\em Bell Sys. Tech. Journal}, 49:1705--1712, Oct. 1970.

\bibitem{ebert-gaussfeed}
P.M. Ebert.
\newblock The capacity of the {G}aussian channel with feedback.
\newblock {\em Bell Sys. Tech. Journal}, pages 1705--1712, October 1970.

\bibitem{eggleston-book}
H.G. Eggleston.
\newblock {\em Convexity}.
\newblock Cambridge Tracts in Mathematics and Mathematical Physics, No. 47.
  Cambridge University Press, Cambridge, UK, 1969.

\bibitem{elgamal-bcfeedback}
A.~El~Gamal.
\newblock The feedback capacity of degraded broadcast channels.
\newblock {\em IEEE Trans. Inform. Theory}, IT-24:379--381, 1978.

\bibitem{elgamal-1979}
A.~El~Gamal.
\newblock The capacity region of a class of broadcast channels.
\newblock {\em IEEE Trans. Inform. Theory}, IT-25:166--169, 1979.

\bibitem{elgamal-cover-survey}
A.~El~Gamal and T.M. Cover.
\newblock Multiple user information theory.
\newblock {\em Proc. IEEE}, 68:1466--1483, 1980.

\bibitem{cover-elgamal-multipledesc}
A.~El~Gamal and T.M. Cover.
\newblock Achievable rates for multiple descriptions.
\newblock {\em IEEE Trans. Inform. Theory}, IT-28:851--857, 1982.

\bibitem{elgamal-vandermeulen-1981}
A.~El~Gamal and E.C. Van~der Meulen.
\newblock A proof of {M}arton's coding theorem for the discrete memoryless
  broadcast channel.
\newblock {\em IEEE Trans. Inform. Theory}, IT-27:120--122, 1981.

\bibitem{elias-1954}
P.~Elias.
\newblock Error-free coding.
\newblock {\em IRE Trans. Inform. Theory}, IT-4:29--37, 1954.

\bibitem{elias-1955}
P.~Elias.
\newblock Coding for noisy channels.
\newblock In {\em IRE Convention Record, Pt. 4}, pages 37--46, 1955.

\bibitem{kyfan-1950}
Ky~Fan.
\newblock On a theorem of {W}eyl concerning the eigenvalues of linear
  transformations {II}.
\newblock {\em Proc. National Acad. Sci. U.S.}, 36:31--35, 1950.

\bibitem{kyfan-1955}
Ky~Fan.
\newblock Some inequalities concerning positive-definite matrices.
\newblock {\em Proc. Cambridge Phil. Soc.}, 51:414--421, 1955.

\bibitem{fano-fanoineq}
R.M. Fano.
\newblock Class notes for transmission of information, course 6.574.
\newblock Technical report, MIT, Cambridge, Mass., 1952.

\bibitem{fano-book}
R.M. Fano.
\newblock {\em Transmission of Information: A Statistical Theory of
  Communication}.
\newblock Wiley, New York, 1961.

\bibitem{feinstein-1954}
A.~Feinstein.
\newblock A new basic theorem of information theory.
\newblock {\em IRE Trans. Inform. Theory}, IT-4:2--22, 1954.

\bibitem{feinstein-book}
A.~Feinstein.
\newblock {\em Foundations of Information Theory}.
\newblock McGraw-Hill, New York, 1958.

\bibitem{feinstein-1959}
A.~Feinstein.
\newblock On the coding theorem and its converse for finite-memory channels.
\newblock {\em Information and Control}, 2:25--44, 1959.

\bibitem{feller-book-vol1}
W.~Feller.
\newblock {\em An Introduction to Probability Theory and Its Applications},
  volume~1.
\newblock Wiley, New York, second edition, 1957.

\bibitem{fisher-suffstat}
R.A. Fisher.
\newblock On the mathematical foundations of theoretical statistics.
\newblock {\em Philos. Trans. Roy. Soc., London, Sec. A}, 222:309--368, 1922.

\bibitem{fisher-1925}
R.A. Fisher.
\newblock Theory of statistical estimation.
\newblock {\em Proc. Cambridge Phil. Society}, 22:700--725, 1925.

\bibitem{ford-fulkerson-1962}
L.R. Ford and D.R. Fulkerson.
\newblock {\em Flows in Networks}.
\newblock Princeton University Press, Princeton, NJ, 1962.

\bibitem{forney-1968}
G.D. Forney.
\newblock Exponential error bounds for erasure, list and decision feedback
  schemes.
\newblock {\em IEEE Trans. Inform. Theory}, IT-14:549--557, 1968.

\bibitem{forney-coursenotes}
G.D. Forney.
\newblock Information theory: unpublished course notes.
\newblock Stanford University, 1972.

\bibitem{franaszek-1969}
P.A. Franaszek.
\newblock On synchronous variable length coding for discrete noiseless
  channels.
\newblock {\em Information and Control}, 15:155--164, 1969.

\bibitem{gaarder-wolf-1975}
T.~Gaarder and J.K. Wolf.
\newblock The capacity region of a multiple-access discrete memoryless channel
  can increase with feedback.
\newblock {\em IEEE Trans. Inform. Theory}, IT-21:100--102, 1975.

\bibitem{gallager-1965}
R.~G. Gallager.
\newblock A simple derivation of the coding theorem and some applications.
\newblock {\em IEEE Trans. Inform. Theory}, IT-11:3--18, 1965.

\bibitem{gallager-1974}
R.~G. Gallager.
\newblock Capacity and coding for degraded broadcast channels.
\newblock {\em Problemy Peredaci Informaccii}, 10(3):3--14, 1974.

\bibitem{gallager-book}
R.G. Gallager.
\newblock {\em Information Theory and Reliable Communication}.
\newblock Wiley, New York, 1968.

\bibitem{gilbert-moore-1959}
E.W. Gilbert and E.F. Moore.
\newblock Variable length binary encodings.
\newblock {\em Bell Sys. Tech. Journal}, 38:933--967, 1959.

\bibitem{goldman-book}
S.~Goldman.
\newblock {\em Information Theory}.
\newblock Prentice-Hall, Englewood Cliffs, NJ, 1953.

\bibitem{gray-1975}
R.M. Gray.
\newblock Sliding block source coding.
\newblock {\em IEEE Trans. Inform. Theory}, IT-21:357--368, 1975.

\bibitem{gray-1990-book}
R.M. Gray.
\newblock {\em Entropy and Information Theory}.
\newblock Springer-Verlag, New York, 1990.

\bibitem{gray-wyner-1974}
R.M. Gray and A.~Wyner.
\newblock Source coding for a simple network.
\newblock {\em Bell Sys. Tech. Journal}, 58:1681--1721, 1974.

\bibitem{grenander-szego-book}
U.~Grenander and G.~Szego.
\newblock {\em Toeplitz forms and their applications}.
\newblock University of California Press, Berkeley, 1958.

\bibitem{grunbaum-book}
B.~Gr{\"{u}}nbaum.
\newblock {\em Convex Polytopes}.
\newblock Interscience, New York, 1967.

\bibitem{guiasu-book}
S.~Guiasu.
\newblock {\em Information Theory with Applications}.
\newblock McGraw-Hill, New York, 1976.

\bibitem{hamming-1950}
R.V. Hamming.
\newblock Error detecting and error correcting codes.
\newblock {\em Bell Sys. Tech. Journal}, 29:147--160, 1950.

\bibitem{han-nonnegent}
T.S. Han.
\newblock Nonnegative entropy measures of multivariate symmetric correlations.
\newblock {\em Information and Control}, 36(2):133--156, 1978.

\bibitem{han-smac}
T.S. Han.
\newblock The capacity region of a general multiple access channel with certain
  correlated sources.
\newblock {\em Information and Control}, 40:37--60, 1979.

\bibitem{han-costa-1987}
T.S. Han and M.H.M. Costa.
\newblock Broadcast channels with arbitrarily correlated sources.
\newblock {\em IEEE Trans. Inform. Theory}, IT-33:641--650, 1987.

\bibitem{han-kobayashi-1981}
T.S. Han and K.~Kobayashi.
\newblock A new achievable rate region for the interference channel.
\newblock {\em IEEE Trans. Inform. Theory}, IT-27:49--60, 1981.

\bibitem{hartley-1928}
R.V. Hartley.
\newblock Transmission of information.
\newblock {\em Bell Sys. Tech. Journal}, 7:535, 1928.

\bibitem{hocquenghem-1959}
P.A. Hocquenghem.
\newblock Codes correcteurs d'erreurs.
\newblock {\em Chiffres}, 2:147--156, 1959.

\bibitem{holsinger-waterfilling}
J.L. Holsinger.
\newblock Digital communication over fixed time-continuous channels with
  memory, with special application to telephone channels.
\newblock Technical report, M.I.T., 1964.

\bibitem{hopcroft-ullman}
J.~E. Hopcroft and J.~D. Ullman.
\newblock {\em Introduction to Automata Theory, Formal Languages and
  computation}.
\newblock Addison Wesley, 1979.

\bibitem{horibe-1977}
Y.~Horibe.
\newblock An improved bound for weight-balanced tree.
\newblock {\em Information and Control}, 34:148--151, 1977.

\bibitem{huffman-huffcode}
D.A. Huffman.
\newblock A method for the construction of minimum redundancy codes.
\newblock {\em Proc. IRE}, 40:1098--1101, 1952.

\bibitem{jaynes-1957-1}
E.T. Jaynes.
\newblock Information theory and statistical mechanics.
\newblock {\em Phys. Rev.}, 106:620, 1957.

\bibitem{jaynes-1957-2}
E.T. Jaynes.
\newblock Information theory and statistical mechanics.
\newblock {\em Phys. Rev.}, 108:171, 1957.

\bibitem{jaynes-1982}
E.T. Jaynes.
\newblock On the rationale of maximum entropy methods.
\newblock {\em Proc. IEEE}, 70:939--952, 1982.

\bibitem{jaynes-coll}
E.T. Jaynes.
\newblock {\em Papers on Probability, Statistics and Statistical Physics}.
\newblock Reidel, 1982.

\bibitem{jelinek-treecode}
F.~Jelinek.
\newblock Buffer overflow in variable length encoding of fixed rate sources.
\newblock {\em IEEE Trans. Inform. Theory}, IT-14:490--501, 1968.

\bibitem{jelinek-1968}
F.~Jelinek.
\newblock Evaluation of expurgated error bounds.
\newblock {\em IEEE Trans. Inform. Theory}, IT-14:501--505, 1968.

\bibitem{jelinek-book}
F.~Jelinek.
\newblock {\em Probabilistic Information Theory}.
\newblock Mc{G}raw Hill, New York, 1968.

\bibitem{justesen-1972}
J.~Justesen.
\newblock A class of constructive asymptotically good algebraic codes.
\newblock {\em IEEE Trans. Inform. Theory}, IT-18:652--656, 1972.

\bibitem{kailath-schalkwijk-1966}
T.~Kailath and J.P.M. Schwalkwijk.
\newblock A coding scheme for additive noise channels with feedback---{P}art
  {I}: No bandwidth constraints.
\newblock {\em IEEE Trans. Inform. Theory}, IT-12:172--182, 1966.

\bibitem{karush-1961}
J.~Karush.
\newblock A simple proof of an inequality of {M}c{M}illan.
\newblock {\em IRE Trans. Inform. Theory}, IT-7:118, 1961.

\bibitem{kelly-horserace}
J.~Kelly.
\newblock A new interpretation of information rate.
\newblock {\em Bell Sys. Tech. Journal}, 35:917--926, July 1956.

\bibitem{kemperman-1967}
J.H.B. Kemperman.
\newblock {\em On the optimum rate of transmitting information}, pages
  126--169.
\newblock Lecture Notes in Mathematics. Springer, 1967.

\bibitem{kendall-stuart-1977}
M.~Kendall and A.~Stuart.
\newblock {\em The Advanced Theory of Statistics}.
\newblock McMillan, 1977.

\bibitem{khinchin-book}
A.~Ya. Khinchin.
\newblock {\em Mathematical Foundations of Information Theory}.
\newblock Dover, New York, 1957.

\bibitem{kieffer-aep}
J.C. Kieffer.
\newblock A simple proof of the {M}oy-{P}erez generalization of the
  {S}hannon-{M}c{M}illan theorem.
\newblock {\em Pacific J. Math.}, 51:203--206, 1974.

\bibitem{knuth-yao-1976}
D.E. Knuth and A.C. Yao.
\newblock The complexity of random number generation.
\newblock In J.F. Traub, editor, {\em Algorithms and Complexity : Recent
  Results and New Directions. Proceedings of the Symposium on New Directions
  and Recent Results in Algorithms and Complexity, Carnegie-Mellon University,
  1976.}, pages 357--428. Academic Press, New York, 1976.

\bibitem{kolmogorov-1956}
A.N. Kolmogorov.
\newblock On the {S}hannon theory of information transmission in the case of
  continuous signals.
\newblock {\em IRE Trans. Inform. Theory}, IT-2:102--108, September 1956.

\bibitem{kolmogorov-1958}
A.N. Kolmogorov.
\newblock A new invariant for transitive dynamical systems.
\newblock {\em Dokl. An. SSR}, 119:861--864, 1958.

\bibitem{kolmo-1965}
A.N. Kolmogorov.
\newblock Three approaches to the quantitative definition of information.
\newblock {\em Problems of Information Transmission}, 1:4--7, 1965.

\bibitem{kolmo-1968}
A.N. Kolmogorov.
\newblock Logical basis for information theory and probability theory.
\newblock {\em IEEE Trans. Inform. Theory}, IT-14:662--664, 1968.

\bibitem{korner-marton-1977-lessnoisy}
J.~K{\"{o}}rner and K.~Marton.
\newblock The comparison of two noisy channels.
\newblock In I.~Csisz{\'{a}}r and P.~Elias, editors, {\em Topics in Information
  Theory}, pages 411--423. Coll. Math. Soc. J. Bolyai, No. 16, North Holland,
  Amsterdam, 1977.

\bibitem{korner-marton-1977}
J.~K{\"{o}}rner and K.~Marton.
\newblock General broadcast channels with degraded message sets.
\newblock {\em IEEE Trans. Inform. Theory}, IT-23:60--64, 1977.

\bibitem{korner-marton-1979}
J.~K{\"{o}}rner and K.~Marton.
\newblock How to encode the modulo 2 sum of two binary sources.
\newblock {\em IEEE Trans. Inform. Theory}, IT-25:219--221, 1979.

\bibitem{kotelnikov-book}
V.A. Kotel'nikov.
\newblock {\em The theory of optimum noise immunity}.
\newblock McGraw-Hill, New York, 1959.

\bibitem{kraft-kraftineq}
L.G. Kraft.
\newblock A device for quanitizing, grouping and coding amplitude modulated
  pulsese.
\newblock Master's thesis, Dept. of Electrical Engg., MIT, Cambridge, Mass.,
  1949.

\bibitem{kullback-book}
S.~Kullback.
\newblock {\em Information Theory and Statistics}.
\newblock Wiley, New York, 1959.

\bibitem{kullback-1967}
S.~Kullback.
\newblock A lower bound for discrimination in terms of variation.
\newblock {\em IEEE Trans. Inform. Theory}, IT-13:126--127, 1967.

\bibitem{kullback-leibler-1951}
S.~Kullback and R.A. Leibler.
\newblock On information and sufficiency.
\newblock {\em Ann. Math. Stat.}, 22:79--86, 1951.

\bibitem{landau-pollak-1961}
H.J. Landau and H.O. Pollak.
\newblock Prolate spheroidal wave functions, {F}ourier analysis and
  uncertainty: {P}art {II}.
\newblock {\em Bell Sys. Tech. Journal}, 40:65--84, 1961.

\bibitem{landau-pollak-1962}
H.J. Landau and H.O. Pollak.
\newblock Prolate spheroidal wave functions, {F}ourier analysis and
  uncertainty: {P}art {III}.
\newblock {\em Bell Sys. Tech. Journal}, 41:1295--1336, 1962.

\bibitem{langdon-1984}
G.G. Langdon.
\newblock An introduction to arithmetic coding.
\newblock {\em IBM Journal of Research and Development}, 28:135--149, 1984.

\bibitem{langdon-rissanen-arithmetic}
G.G. Langdon and J.J. Rissanen.
\newblock A simple general binary source code.
\newblock {\em IEEE Trans. Inform. Theory}, IT-28:800, 1982.

\bibitem{latane-1959}
H.A. Latan\'{e}.
\newblock Criteria for choice among risky ventures.
\newblock {\em Journal of Political Economy}, 38:145--155, April 1959.

\bibitem{latane-tuttle-1967}
H.A. Latan\'{e} and D.L. Tuttle.
\newblock Criteria for portfolio building.
\newblock {\em Journal of Finance}, 22:359--373, September 1967.

\bibitem{lehmann-scheffe-minsuff}
E.L. Lehmann and H.~Scheff\'{e}.
\newblock Completeness, similar regions and unbiased estimation.
\newblock {\em Sankhya}, 10:305--340, 1950.

\bibitem{lempel-ziv-1976}
A.~Lempel and J.~Ziv.
\newblock On the complexity of finite sequences.
\newblock {\em IEEE Trans. Inform. Theory}, IT-22:75--81, 1976.

\bibitem{levin-1973}
L.A. Levin.
\newblock On the notion of a random sequence.
\newblock {\em Soviet Mathematics Doklady}, 14:1413--1416, 1973.

\bibitem{levin-1970}
L.A. Levin and A.K. Zvonkin.
\newblock The complexity of finite objects and the development of the concepts
  of information and randomness by means of the theory of algorithms.
\newblock {\em Russian Mathematical Surveys}, 25/6:83--124, 1970.

\bibitem{liao-multipleaccess}
H.~Liao.
\newblock {\em Multiple access channels}.
\newblock PhD thesis, Department of Electrical Engineering, University of
  Hawaii, Honolulu, 1972.

\bibitem{lin-costello-book}
S.~Lin and D.J. Costello, Jr.
\newblock {\em Error Control Coding: Fundamentals and Applications}.
\newblock Prentice Hall, Englewood Cliffs, NJ., 1983.

\bibitem{linde-buzo-gray-1980}
Y.~Linde, A.~Buzo, and R.M. Gray.
\newblock An algorithm for vector quantizer design.
\newblock {\em IEEE Transactions on Communications}, COM-28:84--95, 1980.

\bibitem{lloyd-1957}
S.P. Lloyd.
\newblock Least squares quantization in pcm.
\newblock Technical report, Bell Laboratories Technical Note, 1957.

\bibitem{lovasz-1979}
L.~Lovasz.
\newblock On the {S}hannon capacity of a graph.
\newblock {\em IEEE Trans. Inform. Theory}, IT-25:1--7, 1979.

\bibitem{lucky-book}
R.W. Lucky.
\newblock {\em Silicon Dreams: Information, Man and Machine}.
\newblock St. Martin's Press, New York, 1989.

\bibitem{marcus-basic}
B.~Marcus.
\newblock Sofic systems and encoding data.
\newblock {\em IEEE Trans. Inform. Theory}, IT-31(3):366--377, May 1985.

\bibitem{marshall-olkin-book}
A.~Marshall and I.~Olkin.
\newblock {\em Inequalities: Theory of Majorization and its Applications}.
\newblock Academic Press, 1979.

\bibitem{marshall-olkin-1982}
A.~Marshall and I.~Olkin.
\newblock A convexity proof of {H}adamard's inequality.
\newblock {\em Am. Math. Monthly}, 89(9):687--688, 1982.

\bibitem{martin-lof-1966}
P~Martin-{L\"{o}f}.
\newblock The definition of random sequences.
\newblock {\em Information and Control}, 9:602--619, 1966.

\bibitem{marton-1974}
K.~Marton.
\newblock Error exponent for source coding with a fidelity criterion.
\newblock {\em IEEE Trans. Inform. Theory}, IT-20:197--199, 1974.

\bibitem{marton-1979}
K.~Marton.
\newblock A coding theorem for the discrete memoryless broadcast channel.
\newblock {\em IEEE Trans. Inform. Theory}, IT-25:306--311, 1979.

\bibitem{mcdonald-schultheiss-1964}
R.A. McDonald and P.M. Schultheiss.
\newblock Information rates of {G}aussian signals under criteria constraining
  the error spectrum.
\newblock {\em Proc. IEEE}, 52:415--416, 1964.

\bibitem{mceliece-book}
R.J. Mc{E}liece.
\newblock {\em The Theory of Information and Coding}.
\newblock Addison-Wesley, Reading, Mass., 1977.

\bibitem{mcmillan-aep}
B.~McMillan.
\newblock The basic theorems of information theory.
\newblock {\em Ann. Math. Stat.}, 24:196--219, 1953.

\bibitem{mcmillan-kraftineq}
B.~McMillan.
\newblock Two inequalities implied by unique decipherability.
\newblock {\em IEEE Trans. Inform. Theory}, IT-2:115--116, 1956.

\bibitem{merton-samuelson-1974}
R.C. Merton and P.A. Samuelson.
\newblock Fallacy of the log-normal approximation to optimal portfolio
  decision-making over many periods.
\newblock {\em Journal of Financial Economics}, 1:67--94, 1974.

\bibitem{minkowski-1950}
H.~Minkowski.
\newblock Diskontinuit{\"{a}}tsbereich f{\"{u}}r arithmetische
  {\"{a}}quivalenz.
\newblock {\em Journal f{\"{u}}r Math.}, 129:220--274, 1950.

\bibitem{mirsky-szasz}
L.~Mirsky.
\newblock On a generalization of {H}adamard's determinantal inequality due to
  {S}zasz.
\newblock {\em Arch. Math.}, VIII:274--275, 1957.

\bibitem{moy-aep}
S.C. Moy.
\newblock Generalizations of the {S}hannon-{M}c{M}illan theorem.
\newblock {\em Pacific Journal of Mathematics}, 11:705--714, 1961.

\bibitem{neyman-pearson-1933}
J.~Neyman and E.S. Pearson.
\newblock On the problem of the most efficient tests of statistical hypotheses.
\newblock {\em Phil. Trans. Roy. Soc., London, Series A}, 231:289--337, 1933.

\bibitem{nyquist-1928}
H.~Nyquist.
\newblock Certain factors affecting telegraph speed.
\newblock {\em Bell Sys. Tech. Journal}, 3:324, 1924.

\bibitem{omura-1973}
J.~Omura.
\newblock A coding theorem for discrete time sources.
\newblock {\em IEEE Trans. Inform. Theory}, IT-19:490--498, 1973.

\bibitem{oppenheim-1930}
A.~Oppenheim.
\newblock Inequalities connected with definite {H}ermitian forms.
\newblock {\em J. London Math. Soc.}, 5:114--119, 1930.

\bibitem{orey-aep}
S.~Orey.
\newblock On the {S}hannon-{P}erez-{M}oy theorem.
\newblock {\em Contemp. Math.}, 41:319--327, 1985.

\bibitem{ornstein-1970}
D.S. Ornstein.
\newblock Bernoulli shifts with the same entropy are isomorphic.
\newblock {\em Advances in Math.}, 4:337--352, 1970.

\bibitem{ozarow-1984}
L.H. Ozarow.
\newblock The capacity of the white {G}aussian multiple access channel with
  feedback.
\newblock {\em IEEE Trans. Inform. Theory}, IT-30:623--629, 1984.

\bibitem{ozarow-leung-1984}
L.H. Ozarow and C.S.K. Leung.
\newblock An acheivable region and an outer bound for the {G}aussian broadcast
  channel with feedback.
\newblock {\em IEEE Trans. Inform. Theory}, IT-30:667--671, 1984.

\bibitem{pagels-book}
H.~Pagels.
\newblock {\em The dreams of reason: the computer and the rise of the sciences
  of complexity}.
\newblock Simon and Schuster, New York, 1988.

\bibitem{pasco-thesis}
R.~Pasco.
\newblock {\em Source coding algorithms for fast data compression}.
\newblock PhD thesis, Stanford University, 1976.

\bibitem{perez-aep}
A.~Perez.
\newblock Extensions of {S}hannon-{M}c{M}illan's limit theorem to more general
  stochastic processes.
\newblock In {\em Trans. Third Prague Conference on Information Theory,
  Statistical Decision Functions and Random Processes}, pages 545--574, Prague,
  1964. Czechoslovak Academy of Sciences.

\bibitem{pinkston-1969}
J.T. Pinkston.
\newblock An application of rate-distortion theory to a converse to the coding
  theorem.
\newblock {\em IEEE Trans. Inform. Theory}, IT-15:66--71, 1969.

\bibitem{pinsker-book}
M.~Pinsker.
\newblock {\em Information and Information Stability of Random Variables and
  Processes}.
\newblock Holden-Day Inc, San Francisco, 1964.
\newblock Translated by Amiel Feinstein.

\bibitem{pinsker-1969}
M.~S. Pinsker.
\newblock Talk at {S}oviet {I}nformation {T}heory meeting, 1969.
\newblock no abstract published.

\bibitem{pinsker-1978}
M.~S. Pinsker.
\newblock The capacity region of noiseless broadcast channels.
\newblock {\em Problems of Information Transmission}, 14(2):97--102, 1978.

\bibitem{pinsker-1960}
M.S. Pinsker.
\newblock {\em Information and Stability of Random Variables and Processes}.
\newblock Izd. Akad. Nauk, 1960.
\newblock Translated by A. Feinstein, 1964.

\bibitem{rabiner-schafer-book}
L.R. Rabiner and R.W. Schafer.
\newblock {\em Digital processing of speech signals}.
\newblock Prentice-Hall, Englewood Cliffs, N.J., 1978.

\bibitem{rao-1945}
C.R. Rao.
\newblock Information and accuracy obtainable in the estimation of statistical
  parameters.
\newblock {\em Bull. Calcutta Math. Soc.}, 37:81--91, 1945.

\bibitem{reza-book}
F.M. Reza.
\newblock {\em An Introduction to Information Theory}.
\newblock McGraw-Hill, New York, 1961.

\bibitem{rice-1950}
S.O. Rice.
\newblock Communication in the presence of noise---probability of error for two
  encoding schemes.
\newblock {\em Bell Sys. Tech. Journal}, 29:60--93, 1950.

\bibitem{rissanen-1976}
J.~Rissanen.
\newblock Generalized {K}raft inequality and arithmetic coding.
\newblock {\em IBM Journal of Research and Development}, 20:198, 1976.

\bibitem{rissanen-1978}
J.~Rissanen.
\newblock Modelling by shortest data description.
\newblock {\em Automatica}, 14:465--471, 1978.

\bibitem{rissanen-1983}
J.~Rissanen.
\newblock A universal prior for integers and estimation by minimum description
  length.
\newblock {\em Ann. Stat.}, 11:416--431, 1983.

\bibitem{rissanen-1984}
J.~Rissanen.
\newblock Universal coding, information, prediction and estimation.
\newblock {\em IEEE Trans. Inform. Theory}, IT-30:629--636, 1984.

\bibitem{rissanen-1986}
J.~Rissanen.
\newblock Stochastic complexity and modelling.
\newblock {\em Ann. Stat.}, 14:1080--1100, 1986.

\bibitem{rissanen-1987}
J.~Rissanen.
\newblock Stochastic complexity (with discussions).
\newblock {\em Journal of the Royal Statistical Society}, 49:223--239,
  252--265, 1987.

\bibitem{rissanen-book}
J.~Rissanen.
\newblock {\em Stochastic complexity in Statistical Inquiry}.
\newblock World Scientific, New Jersey, 1989.

\bibitem{samuelson-1969}
P.A. Samuelson.
\newblock Lifetime portfolio selection by dynamic stochastic programming.
\newblock {\em Rev. of Economics and Statistics}, pages 236--239, 1969.

\bibitem{samuelson-1971}
P.A. Samuelson.
\newblock The `fallacy' of maximizing the geometric mean in long sequences of
  investing or gambling.
\newblock {\em Proc. Nat. Acad. Science}, 68:214--224, October 1971.

\bibitem{samuelson-1979}
P.A. Samuelson.
\newblock Why we should not make mean log of wealth big though years to act are
  long.
\newblock {\em Journal of Banking and Finance}, 3:305--307, 1979.

\bibitem{sanov-1957}
I.N. Sanov.
\newblock On the probability of large deviations of random variables.
\newblock {\em Mat. Sbornik}, 42:11--44, 1957.
\newblock English translation in {\em Sel. Transl. Math. Statist. Probab.,}
  vol. 1, pp. 213-244, 1961.

\bibitem{sardinas-patterson-1953}
A.A. Sardinas and G.W. Patterson.
\newblock A necessary and sufficient condition for the unique decomposition of
  coded messages.
\newblock In {\em IRE Convention Record, Part 8}, pages 104--108, 1953.

\bibitem{sato-1978}
H.~Sato.
\newblock On the capacity region of a discrete two-user channel for strong
  interference.
\newblock {\em IEEE Trans. Inform. Theory}, IT-24:377--379, 1978.

\bibitem{sato-1981}
H.~Sato.
\newblock The capacity of the {G}aussian interference channel under strong
  interference.
\newblock {\em IEEE Trans. Inform. Theory}, IT-27:786--788, 1981.

\bibitem{sato-tanabe-1978}
H.~Sato and M.~Tanabe.
\newblock A discrete two-user channel with strong interference.
\newblock {\em Trans. IECE Japan}, 61:880--884, 1978.

\bibitem{schalkwijk-bmc1}
J.P.M. Schalkwijk.
\newblock The binary multiplying channel---a coding scheme that operates beyond
  {S}hannon's inner bound.
\newblock {\em IEEE Trans. Inform. Theory}, IT-28:107--110, 1982.

\bibitem{schalkwijk-bmc2}
J.P.M. Schalkwijk.
\newblock On an extension of an achievable rate region for the binary
  multiplying channel.
\newblock {\em IEEE Trans. Inform. Theory}, IT-29:445--448, 1983.

\bibitem{schnorr-1971}
C.P. Schnorr.
\newblock A unified approach to the definition of random sequences.
\newblock {\em Mathematical System Theory}, 5:246--258, 1971.

\bibitem{schnorr-1973}
C.P. Schnorr.
\newblock Process, complexity and effective random tests.
\newblock {\em Journal of Computer and System Sciences}, 7:376--388, 1973.

\bibitem{schnorr-1977}
C.P. Schnorr.
\newblock A surview on the theory of random sequences.
\newblock In R.~Butts and J.~Hinitikka, editors, {\em Logic, methodology and
  philosophy of science}. Reidel, Dodrecht, 1977.

\bibitem{schwarz-1978}
G.~Schwarz.
\newblock Estimating the dimension of a model.
\newblock {\em Ann. Stat.}, 6:461--464, 1978.

\bibitem{shannon-1948}
C.~E. Shannon.
\newblock A mathematical theory of communication.
\newblock {\em Bell Sys. Tech. Journal}, 27:379--423,623--656, 1948.

\bibitem{shannon-1956}
C.~E. Shannon.
\newblock The zero-error capacity of a noisy channel.
\newblock {\em IRE Trans. Inform. Theory}, IT-2:8--19, 1956.

\bibitem{shannon-1949}
C.E. Shannon.
\newblock Communication in the presence of noise.
\newblock {\em Proc. IRE}, 37:10--21, January 1949.

\bibitem{shannon-cryptography}
C.E. Shannon.
\newblock Communication theory of secrecy systems.
\newblock {\em Bell Sys. Tech. Journal}, 28:656--715, 1949.

\bibitem{shannon-entenglish}
C.E. Shannon.
\newblock Prediction and entropy of printed {E}nglish.
\newblock {\em Bell Sys. Tech. Journal}, 30:50--64, January 1951.

\bibitem{shannon-1957}
C.E. Shannon.
\newblock Certain results in coding theory for noisy channels.
\newblock {\em Information and Control}, 1:6--25, 1957.

\bibitem{shannon-1958-sideinf}
C.E. Shannon.
\newblock Channels with side information at the transmitter.
\newblock {\em IBM J. Res. Develop.}, 2:289--293, 1958.

\bibitem{shannon-1959}
C.E. Shannon.
\newblock Coding theorems for a discrete source with a fidelity criterion.
\newblock {\em IRE National Convention Record, Part 4}, pages 142--163, 1959.

\bibitem{shannon-twoway}
C.E. Shannon.
\newblock Two-way communication channels.
\newblock In {\em Proc. 4th Berkeley Symp. Math. Stat. Prob.}, volume~1, pages
  611--644. Univ. California Press, 1961.

\bibitem{shannon-gallager-berlekamp-1967-1}
C.E. Shannon, R.G. Gallager, and E.R. Berlekamp.
\newblock Lower bounds to error probability for coding in discrete memoryless
  channels. {I}.
\newblock {\em Information and Control}, 10:65--103, 1967.

\bibitem{shannon-gallager-berlekamp-1967-2}
C.E. Shannon, R.G. Gallager, and E.R. Berlekamp.
\newblock Lower bounds to error probability for coding in discrete memoryless
  channels. {II}.
\newblock {\em Information and Control}, 10:522--552, 1967.

\bibitem{shannon-weaver-book}
C.E. Shannon and W.W. Weaver.
\newblock {\em The Mathematical Theory of Communication}.
\newblock University of Illinois Press, Urbana, Ill., 1949.

\bibitem{sharpe-book}
W.F. Sharpe.
\newblock {\em Investments}.
\newblock Prentice-Hall, Englewood Cliffs, NJ, 3rd edition, 1985.

\bibitem{shore-johnson-1980}
J.E. Shore and R.W. Johnson.
\newblock Axiomatic derivation of the principle of maximum entropy and the
  principle of minimum cross-entropy.
\newblock {\em IEEE Trans. Inform. Theory}, IT-26:26--37, 1980.

\bibitem{slepian-book}
D.~Slepian.
\newblock {\em Key Papers in the Development of Information Theory}.
\newblock IEEE Press, New York, 1974.

\bibitem{slepian-pollak-1961}
D.~Slepian and H.O. Pollak.
\newblock Prolate spheroidal wave functions, {F}ourier analysis and
  uncertainty: {P}art {I}.
\newblock {\em Bell Sys. Tech. Journal}, 40:43--64, 1961.

\bibitem{slepian-wolf-mac}
D.~Slepian and J.K. Wolf.
\newblock A coding theorem for multiple access channels with correlated
  sources.
\newblock {\em Bell Sys. Tech. Journal}, 52:1037--1076, 1973.

\bibitem{slepian-wolf-1973}
D.~Slepian and J.K. Wolf.
\newblock Noiseless coding of correlated information sources.
\newblock {\em IEEE Trans. Inform. Theory}, IT-19:471--480, 1973.

\bibitem{solomonoff-1964}
R.J. Solomonoff.
\newblock A formal theory of inductive inference.
\newblock {\em Information and Control}, 7:1--22,224--254, 1964.

\bibitem{stam-1959}
A.~Stam.
\newblock Some inequalities satisfied by the quantities of information of
  {F}isher and {S}hannon.
\newblock {\em Information and Control}, 2:101--112, June 1959.

\bibitem{storer-szymanski-1982}
J.A. Storer and T.G. Szymanski.
\newblock Data compression via textual substitution.
\newblock {\em J. ACM}, 29(4):928--951, 1982.

\bibitem{tang-bahl-1970}
D.L. Tang and L.R. Bahl.
\newblock Block codes for a class of constrained noiseless channels.
\newblock {\em Inform. Control}, 17:436--461, 1970.

\bibitem{william-occam}
S.C. Tornay.
\newblock {\em Ockham: Studies and Selections}, chapter Commentarium in
  Sententias, I, 27.
\newblock Open Court Publishers, La Salle, IL., 1938.

\bibitem{vancampenhout-cover-1981}
J.M. Van~Campenhout and T.M. Cover.
\newblock Maximum entropy and conditional probability.
\newblock {\em IEEE Trans. Inform. Theory}, IT-27:483--489, 1981.

\bibitem{vandermeulen-1975}
E.~Van~der Meulen.
\newblock Random coding theorems for the general discrete memoryless broadcast
  channel.
\newblock {\em IEEE Trans. Inform. Theory}, IT-21:180--190, 1975.

\bibitem{vandermeulen-survey}
E.C. Van~der Meulen.
\newblock A survey of multi-way channels in information theory.
\newblock {\em IEEE Trans. Inform. Theory}, IT-23:1--37, 1977.

\bibitem{vandermeulen-surveybroad}
E.C. Van~der Meulen.
\newblock Recent coding theorems for multi-way channels. part {I}: {T}he
  broadcast channel (1976-1980).
\newblock In J.K. Skwyrzinsky, editor, {\em New Concepts in Multi-user
  Communication (NATO Advanced Study Insititute Series)}, pages 15--51.
  Sijthoff \& Noordhoff International, 1981.

\bibitem{vandermeulen-surveymac}
E.C. Van~der Meulen.
\newblock Recent coding theorems and converses for multi-way channels. part
  {II}: {T}he multiple access channel (1976-1985).
\newblock Technical report, Department Wiskunde, Katholieke Universiteit
  Leuven, 1985.

\bibitem{lazo-rathie-1978}
A.C.G. Verdugo~Lazo and P.N. Rathie.
\newblock On the entropy of continuous probability distributions.
\newblock {\em IEEE Trans. Inform. Theory}, IT-24:120--122, 1978.

\bibitem{viterbi-omura-book}
A.J. Viterbi and J.K. Omura.
\newblock {\em Principles of Digital Communication and Coding}.
\newblock McGraw-Hill, New York, 1979.

\bibitem{vyugin-1987}
V.V. V'yugin.
\newblock On the defect of randomness of a finite object with respect to
  measures with given complexity bounds.
\newblock {\em Theory Prob. Appl.}, 32(3):508--512, 1987.

\bibitem{wald-book}
A.~Wald.
\newblock {\em Sequential Analysis}.
\newblock Wiley, New York, 1947.

\bibitem{wiener-cybernetics}
N.~Weiner.
\newblock {\em Cybernetics}.
\newblock MIT Press, Cambridge and Wiley, New York, 1948.

\bibitem{welch-1984}
T.A. Welch.
\newblock A technique for high-performance data compression.
\newblock {\em Computer}, 17(1):8--19, January 1984.

\bibitem{white-1967}
H.E. White.
\newblock Printed {E}nglish compression using dictionary encoding.
\newblock {\em Proc. IEEE}, 55(3):390--396, 1967.

\bibitem{wiener-extrapolation-book}
N.~Wiener.
\newblock {\em Extrapolation, Interpolation and Smoothing of Stationary Time
  Series}.
\newblock MIT Press, Cambridge, Mass. and Wiley, New York, 1949.

\bibitem{integrability-book}
H.J. Wilcox and D.L. Myers.
\newblock {\em An introduction to {L}ebesgue integration and {F}ourier series}.
\newblock R.E.Krieger, Huntington, N.Y., 1978.

\bibitem{willems-1982}
F.M.J. Willems.
\newblock The feedback capacity of a class of discrete memoryless multiple
  access channels.
\newblock {\em IEEE Trans. Inform. Theory}, IT-28:93--95, 1982.

\bibitem{willems-hekstra-1989}
F.M.J. Willems and A.P. Hekstra.
\newblock Dependence balance bounds for single-output two-way channels.
\newblock {\em IEEE Trans. Inform. Theory}, IT-35:44--53, 1989.

\bibitem{witten-neal-cleary-1987}
I.H. Witten, R.M. Neal, and J.G. Cleary.
\newblock Arithmetic coding for data compression.
\newblock {\em Communications of the ACM}, 30(6):520--540, June 1987.

\bibitem{wolfowitz-1957}
J.~Wolfowitz.
\newblock The coding of messages subject to chance errors.
\newblock {\em Illinois Journal of Mathematics}, 1:591--606, 1957.

\bibitem{wolfowitz-book}
J.~Wolfowitz.
\newblock {\em Coding Theorems of Information Theory}.
\newblock Springer Verlag, Berlin and Prentice Hall, Englewood Cliffs, NJ,
  1978.

\bibitem{woodward-book}
P.M. Woodward.
\newblock {\em Probability and Information Theory with Applications to Radar}.
\newblock McGraw-Hill, New York, 1953.

\bibitem{wozencraft-jacobs-book}
J.M. Wozencraft and I.M. Jacobs.
\newblock {\em Principles of Communication Engineering}.
\newblock Wiley, New York, 1965.

\bibitem{wyner-1973}
A.~Wyner.
\newblock A theorem on the entropy of certain binary sequences and applications
  {II}.
\newblock {\em IEEE Trans. Inform. Theory}, IT-19:772--777, 1973.

\bibitem{wyner-1975a}
A.~Wyner.
\newblock The common information of two dependent random variables.
\newblock {\em IEEE Trans. Inform. Theory}, IT-21:163--179, 1975.

\bibitem{wyner-1975}
A.~Wyner.
\newblock On source coding with side information at the decoder.
\newblock {\em IEEE Trans. Inform. Theory}, IT-21:294--300, 1975.

\bibitem{wyner-ziv-1973}
A.~Wyner and J.~Ziv.
\newblock A theorem on the entropy of certain binary sequences and applications
  {I}.
\newblock {\em IEEE Trans. Inform. Theory}, IT-19:769--771, 1973.

\bibitem{wyner-ziv-1976}
A.~Wyner and J.~Ziv.
\newblock The rate distortion function for source coding with side information
  at the receiver.
\newblock {\em IEEE Trans. Inform. Theory}, IT-22:1--11, 1976.

\bibitem{wyner-ziv-1991}
A.~Wyner and J.~Ziv.
\newblock On entropy and data compression.
\newblock Submitted to IEEE Trans. Inform. Theory, 1991.

\bibitem{wyner-1965}
A.D. Wyner.
\newblock The capacity of the band-limited {G}aussian channel.
\newblock {\em Bell Sys. Tech. Journal}, 45:359--371, 1965.

\bibitem{wyner-ziv-1994}
A.D. Wyner and J.~Ziv.
\newblock The sliding window {L}empel-{Z}iv algorithm is asymptotically
  optimal.
\newblock {\em Proc. IEEE}, 82(6):872--877, 1994.

\bibitem{zhang-berger-schalkwijk-1986}
Z.~Zhang, T.~Berger, and J.P.M. Schalkwijk.
\newblock New outer bounds to capacity regions of two-way channels.
\newblock {\em IEEE Trans. Inform. Theory}, IT-32:383--386, 1986.

\bibitem{ziv-1972}
J.~Ziv.
\newblock Coding of sources with unknown statistics---part {II}: Distortion
  relative to a fidelity criterion.
\newblock {\em IEEE Trans. Inform. Theory}, IT-18:389--394, 1972.

\bibitem{ziv-1978}
J.~Ziv.
\newblock Coding theorems for individual sequences.
\newblock {\em IEEE Trans. Inform. Theory}, IT-24:405--412, 1978.

\bibitem{ziv-lempel-1977}
J.~Ziv and A.~Lempel.
\newblock A universal algorithm for sequential data compression.
\newblock {\em IEEE Trans. Inform. Theory}, IT-23:337--343, 1977.

\bibitem{ziv-lempel-1978}
J.~Ziv and A.~Lempel.
\newblock Compression of individual sequences by variable rate coding.
\newblock {\em IEEE Trans. Inform. Theory}, IT-24:530--536, 1978.

\bibitem{zurek-1989-2}
W.H. Zurek.
\newblock Algorithmic randomness and physical entropy.
\newblock {\em Phys. Rev. A}, 40:4731--4751, October 15 1989.

\bibitem{zurek-1989-1}
W.H. Zurek.
\newblock Thermodynamic cost of computation, algorithmic complexity and the
  information metric.
\newblock {\em Nature}, 341(6238):119--124, September 14 1989.

\bibitem{zurek-1990}
W.H. Zurek, editor.
\newblock {\em Complexity, Entropy and the Physics of Information. Proceedings
  of the 1988 Workshop on the Complexity, Entropy and the Physics of
  Information}. Addison-Wesley, New York, 1990.

\end{thebibliography}