BIBLIOGRAPHY 693
[70] B. M. Hochwald, G. Caire, B. Hassibi, and T. L. Marzetta (Eds.). IEEE
Trans. Inf. Theory, Special Issue on Space-Time Transmission, Reception,
Coding and Signal-Processing, Vol. 49, Oct. 2003.
[71] L. Boltzmann. Beziehung Zwischen dem zweiten Hauptsatze der
mechanischen W
¨
armertheorie und der Wahrscheilichkeitsrechnung respek-
tive den Saetzen uber das W
¨
armegleichgwicht. Wien. Ber., pages 373–435,
1877.
[72] R. C. Bose and D. K. Ray-Chaudhuri. On a class of error correcting binary
group codes. Inf. Control, 3:68–79, Mar. 1960.
[73] H. J. Brascamp and E. J. Lieb. Best constants in Young’s inequality, its
converse and its generalization to more than three functions. Adv. Math.,
20:151–173, 1976.
[74] L. Breiman. The individual ergodic theorems of information theory. Ann.
Math. Stat., 28:809–811, 1957. With correction made in 31:809-810.
[75] L. Breiman. Optimal gambling systems for favourable games. In Fourth
Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1,
pages 65–78. University of California Press, Berkeley, CA, 1961.
[76] L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification
and Regression Trees. Wadsworth & Brooks, Pacific Grove, CA, 1984.
[77] L. Brillouin. Science and Information Theory. Academic Press, New York,
1962.
[78] J. A. Bucklew. The source coding theorem via Sanov’s theorem. IEEE
Trans. Inf. Theory, pages 907–909, Nov. 1987.
[79] J. A. Bucklew. Large Deviation Techniques in Decision, Simulation, and
Estimation. Wiley, New York, 1990.
[80] J. P. Burg. Maximum entropy spectral analysis. Ph.D. thesis, Department of
Geophysics, Stanford University, Stanford, CA, 1975.
[81] M. Burrows and D. J. Wheeler. A Block-Sorting Lossless Data Compression
Algorithm (Tech. Rept. 124). Digital Systems Research Center, Palo Alto,
CA, May 1994.
[82] A. R. Calderbank. The art of signaling: fifty years of coding theory. IEEE
Trans. Inf. Theory, pages 2561–2595, Oct. 1998.
[83] A. R. Calderbank and P. W. Shor. Good quantum error-correcting codes
exist. Phys. Rev. A, pages 1098–1106, 1995.
[84] A. Carleial. Outer bounds on the capacity of the interference channel. IEEE
Trans. Inf. Theory, IT-29:602–606, 1983.
[85] A. B. Carleial. A case where interference does not reduce capacity. IEEE
Trans. Inf. Theory, IT-21:569–570, 1975.
[86] G. Chaitin. Information-Theoretic Incompleteness. World Scientific, Singa-
pore, 1992.
[87] G. J. Chaitin. On the length of programs for computing binary sequences.
J. ACM, pages 547–569, 1966.