Cover, T. M. 19382012
Overview
Works:  75 works in 214 publications in 3 languages and 2,405 library holdings 

Roles:  Author, Thesis advisor, Other, Editor 
Classifications:  Q360, 003.54 
Publication Timeline
.
Most widely held works by
T. M Cover
Elements of information theory by
T. M Cover(
Book
)
50 editions published between 1991 and 2012 in 3 languages and held by 1,207 WorldCat member libraries worldwide
"The latest edition of this classic is updated with new problem sets and material The Second Edition of this fundamental textbook maintains the book's tradition of clear, thoughtprovoking instruction. Readers are provided once again with an instructive mix of mathematics, physics, statistics, and information theory. All the essential topics in information theory are covered in detail, including entropy, data compression, channel capacity, rate distortion, network information theory, and hypothesis testing. The authors provide readers with a solid understanding of the underlying theory and applications. Problem sets and a telegraphic summary at the end of each chapter further assist readers. The historical notes that follow each chapter recap the main points. The Second Edition features: * Chapters reorganized to improve teaching * 200 new problems * New material on source coding, portfolio theory, and feedback capacity * Updated references Now current and enhanced, the Second Edition of Elements of Information Theory remains the ideal textbook for upperlevel undergraduate and graduate courses in electrical engineering, statistics, and telecommunications. An Instructor's Manual presenting detailed solutions to all the problems in the book is available from the Wiley editorial department."Publisher's website
50 editions published between 1991 and 2012 in 3 languages and held by 1,207 WorldCat member libraries worldwide
"The latest edition of this classic is updated with new problem sets and material The Second Edition of this fundamental textbook maintains the book's tradition of clear, thoughtprovoking instruction. Readers are provided once again with an instructive mix of mathematics, physics, statistics, and information theory. All the essential topics in information theory are covered in detail, including entropy, data compression, channel capacity, rate distortion, network information theory, and hypothesis testing. The authors provide readers with a solid understanding of the underlying theory and applications. Problem sets and a telegraphic summary at the end of each chapter further assist readers. The historical notes that follow each chapter recap the main points. The Second Edition features: * Chapters reorganized to improve teaching * 200 new problems * New material on source coding, portfolio theory, and feedback capacity * Updated references Now current and enhanced, the Second Edition of Elements of Information Theory remains the ideal textbook for upperlevel undergraduate and graduate courses in electrical engineering, statistics, and telecommunications. An Instructor's Manual presenting detailed solutions to all the problems in the book is available from the Wiley editorial department."Publisher's website
Digital pattern recognition by
K. S Fu(
Book
)
17 editions published between 1975 and 1980 in English and Undetermined and held by 322 WorldCat member libraries worldwide
Since its publication in 1976, the original volume has been warmly received. We have decided to put out this updated paperback edition so that the book can be more accessible to students. This paperback edition is essentially the same as the original hardcover volume except for the addition of a new chapter (Chapter 7) which reviews the recent advances in pattern recognition and image processing. Because of the limitations of length, we can only report the highlights and point the readers to the literature. A few typographical errors in the original edition were corrected. We are grateful to the National Science Foundation and the Office of Naval Research for supporting the editing of this book as well as the work described in Chapter 4 and a part of Chapter 7. West Lafayette, Indiana March 1980 K.S. Fu Preface to the First Edition During the past fifteen years there has been a considerable growth of interest in problems of pattern recognition. Contributions to the blossom of this area have come from many disciplines, including statistics, psychology, linguistics, computer science, biology, taxonomy, switching theory, communication theory, control theory, and operations research. Many different approaches have been proposed and a number of books have been published. Most books published so far deal with the decisiontheoretic (or statistical) approach or the syntactic (or linguistic) is still far from its maturity, many approach
17 editions published between 1975 and 1980 in English and Undetermined and held by 322 WorldCat member libraries worldwide
Since its publication in 1976, the original volume has been warmly received. We have decided to put out this updated paperback edition so that the book can be more accessible to students. This paperback edition is essentially the same as the original hardcover volume except for the addition of a new chapter (Chapter 7) which reviews the recent advances in pattern recognition and image processing. Because of the limitations of length, we can only report the highlights and point the readers to the literature. A few typographical errors in the original edition were corrected. We are grateful to the National Science Foundation and the Office of Naval Research for supporting the editing of this book as well as the work described in Chapter 4 and a part of Chapter 7. West Lafayette, Indiana March 1980 K.S. Fu Preface to the First Edition During the past fifteen years there has been a considerable growth of interest in problems of pattern recognition. Contributions to the blossom of this area have come from many disciplines, including statistics, psychology, linguistics, computer science, biology, taxonomy, switching theory, communication theory, control theory, and operations research. Many different approaches have been proposed and a number of books have been published. Most books published so far deal with the decisiontheoretic (or statistical) approach or the syntactic (or linguistic) is still far from its maturity, many approach
Open problems in communication and computation by
T. M Cover(
Book
)
15 editions published in 1987 in English and held by 278 WorldCat member libraries worldwide
15 editions published in 1987 in English and held by 278 WorldCat member libraries worldwide
Partially controllable random walk by
T. M Cover(
Book
)
2 editions published in 1961 in English and held by 7 WorldCat member libraries worldwide
This paper deals with an almost uncontrollable process which will be termed a partially controlled random walk. A particle performs a random walk on an interval (o, a). A utility U sub o (x) is associated with each position x on (o, a). The amplitude of the random walk is controllable at each stage. The process is termed almost uncontrollable because the random walk is assumed to have zero mean. Gambling terminology is used because of its extensive vocabulary, but the utility functions U sub o (x) can be nonmonotonic and discontinuousmore general functions than their interpretation as gambling utilities would suggest. This problem may be viewed as a sequence of fair gambles on a nonlinear utility function. It is shown that with certain betting sequences a certain higher utility U(x) can be associated with each point x, where U(x) is now the expected utility at the end of the betting sequence beginning with capital x. An upper bound on U(x) (over all possible infinite betting sequences) will be derived. This maximum expected utility U(x) has a very nice relation to U sub o (x), the actual utility
2 editions published in 1961 in English and held by 7 WorldCat member libraries worldwide
This paper deals with an almost uncontrollable process which will be termed a partially controlled random walk. A particle performs a random walk on an interval (o, a). A utility U sub o (x) is associated with each position x on (o, a). The amplitude of the random walk is controllable at each stage. The process is termed almost uncontrollable because the random walk is assumed to have zero mean. Gambling terminology is used because of its extensive vocabulary, but the utility functions U sub o (x) can be nonmonotonic and discontinuousmore general functions than their interpretation as gambling utilities would suggest. This problem may be viewed as a sequence of fair gambles on a nonlinear utility function. It is shown that with certain betting sequences a certain higher utility U(x) can be associated with each point x, where U(x) is now the expected utility at the end of the betting sequence beginning with capital x. An upper bound on U(x) (over all possible infinite betting sequences) will be derived. This maximum expected utility U(x) has a very nice relation to U sub o (x), the actual utility
Antenna pattern distributions from random arrays(
Book
)
2 editions published in 1963 in English and held by 6 WorldCat member libraries worldwide
Research concerns the determination of the probability distribution of the electric field resulting from an arbitrary random array of sources (or scatterers). The distribution is surprisingly simple, is easily calculated for most interesting array distributions, and has wide generality of application. Specifically, we find the antenna pattern distribution of a synthetic aperture antenna formed by a moving space vehicle emitting pulses randomly in time. However, the results apply not only to synthetic aperture antennas of arbitrary distribution but also to randomly deleted antennas and to chaff, meteor trail, and electron cloud diagnostics as well. The problem is restricted to the study of the far field from n sources, the positions of which are independent identically distributed as F(r). Markov's method is then used to analyze what is essentially a twodimensional random walk induced by a threedimensional distribution. It is shown that if the Fourier transform psi(k) of the distribution function F(r) can be performed in closed form, then the limiting form of the probability density of the resultant electric field vector is immediately obvious for every frequency and direction of propagation. Finally, the probability density of the resultant power or envelope is determined in closed form, and the correlation between the resultant field at different angles and frequencies is exhibited
2 editions published in 1963 in English and held by 6 WorldCat member libraries worldwide
Research concerns the determination of the probability distribution of the electric field resulting from an arbitrary random array of sources (or scatterers). The distribution is surprisingly simple, is easily calculated for most interesting array distributions, and has wide generality of application. Specifically, we find the antenna pattern distribution of a synthetic aperture antenna formed by a moving space vehicle emitting pulses randomly in time. However, the results apply not only to synthetic aperture antennas of arbitrary distribution but also to randomly deleted antennas and to chaff, meteor trail, and electron cloud diagnostics as well. The problem is restricted to the study of the far field from n sources, the positions of which are independent identically distributed as F(r). Markov's method is then used to analyze what is essentially a twodimensional random walk induced by a threedimensional distribution. It is shown that if the Fourier transform psi(k) of the distribution function F(r) can be performed in closed form, then the limiting form of the probability density of the resultant electric field vector is immediately obvious for every frequency and direction of propagation. Finally, the probability density of the resultant power or envelope is determined in closed form, and the correlation between the resultant field at different angles and frequencies is exhibited
Geometrical and statistical properties of linear threshold devices by
T. M Cover(
Book
)
5 editions published in 1964 in English and held by 5 WorldCat member libraries worldwide
5 editions published in 1964 in English and held by 5 WorldCat member libraries worldwide
Learning in pattern recognition by
T. M Cover(
Book
)
2 editions published in 1968 in English and held by 4 WorldCat member libraries worldwide
This paper is specifically concerned with the problem of inferring from a finite set of patterns the classification of an unknown pattern. A discussion of the general problems inherent in the concept of 'learning' and 'data reduction' are discussed from a standpoint of measurement selection for the general pattern recognition problem. A brief history of the existent work in empirical Bayes and compound sequential Bayes procedures will be presented. It is felt that these procedures are basically nonBayesian, despite their names, and are therefore especially suited to problems arising in pattern recognition. Finally, a discussion is made of some nonparametric approaches to the problem of the classification of an unknown pattern when the only information on the underlying distributions associated with the various categories is that which can be obtained from a finite number of samples. (Author)
2 editions published in 1968 in English and held by 4 WorldCat member libraries worldwide
This paper is specifically concerned with the problem of inferring from a finite set of patterns the classification of an unknown pattern. A discussion of the general problems inherent in the concept of 'learning' and 'data reduction' are discussed from a standpoint of measurement selection for the general pattern recognition problem. A brief history of the existent work in empirical Bayes and compound sequential Bayes procedures will be presented. It is felt that these procedures are basically nonBayesian, despite their names, and are therefore especially suited to problems arising in pattern recognition. Finally, a discussion is made of some nonparametric approaches to the problem of the classification of an unknown pattern when the only information on the underlying distributions associated with the various categories is that which can be obtained from a finite number of samples. (Author)
Linear rankings of finitedimensional patterns by
T. M Cover(
Book
)
3 editions published in 1966 in English and held by 4 WorldCat member libraries worldwide
The paper determines Q(n, d), the number of ways that n ddimensional pattern vectors can be ordered by projection onto a freelychosen weighting vector. This is equivalent to finding the number of ways of ranking n students on the basis of arbitrary linear combinations of their scores on d examinations. Q(n, d) is independent (subject to minor nonsingularity constraints) of the precise configuration of the pattern vectors, and is naturally expressible as a sum of stirlinglike numbers. (Author)
3 editions published in 1966 in English and held by 4 WorldCat member libraries worldwide
The paper determines Q(n, d), the number of ways that n ddimensional pattern vectors can be ordered by projection onto a freelychosen weighting vector. This is equivalent to finding the number of ways of ranking n students on the basis of arbitrary linear combinations of their scores on d examinations. Q(n, d) is independent (subject to minor nonsingularity constraints) of the precise configuration of the pattern vectors, and is naturally expressible as a sum of stirlinglike numbers. (Author)
Behavior of sequential predictors of binary sequences by
T. M Cover(
Book
)
3 editions published in 1966 in English and held by 4 WorldCat member libraries worldwide
The paper concerns the behavior of sequential predictors of finite sequences of 0's and 1's. The question naturally arises as to whether a predictor can achieve high scores on every sequence in some large subset of sequences that are decided a priori to be nonrandom. What prescribed sets of scores may be achieved, and how may they be achieved. What internal consistencies must be present in the set of sequences yielding high scores. This paper is addressed to these questions
3 editions published in 1966 in English and held by 4 WorldCat member libraries worldwide
The paper concerns the behavior of sequential predictors of finite sequences of 0's and 1's. The question naturally arises as to whether a predictor can achieve high scores on every sequence in some large subset of sequences that are decided a priori to be nonrandom. What prescribed sets of scores may be achieved, and how may they be achieved. What internal consistencies must be present in the set of sequences yielding high scores. This paper is addressed to these questions
Estimation by the nearestneighbor rule by
T. M Cover(
Book
)
3 editions published in 1966 in English and held by 4 WorldCat member libraries worldwide
The nearestneighbor estimate of the random parameter associated with a given observation is defined to be the parameter associated with the nearest observation in some training set. This paper is concerned with the infinite parameter problem (estimation) as opposed to the finite parameter problem (classification). Because of the unboundedness of the loss function in the general estimation problem, certain new considerations are required. For a wide range of probability distributions, the largesample risk of the nearestneighbor estimate is shown here to be less than twice the Bayes risk for metric loss functions and equal to twice the Bayes risk for squarederror loss functions. In this sense, at least half the information in the training set is contained in the nearest neighbor. (Author)
3 editions published in 1966 in English and held by 4 WorldCat member libraries worldwide
The nearestneighbor estimate of the random parameter associated with a given observation is defined to be the parameter associated with the nearest observation in some training set. This paper is concerned with the infinite parameter problem (estimation) as opposed to the finite parameter problem (classification). Because of the unboundedness of the loss function in the general estimation problem, certain new considerations are required. For a wide range of probability distributions, the largesample risk of the nearestneighbor estimate is shown here to be less than twice the Bayes risk for metric loss functions and equal to twice the Bayes risk for squarederror loss functions. In this sense, at least half the information in the training set is contained in the nearest neighbor. (Author)
Hypothesis testing with finite statistics by
T. M Cover(
Book
)
2 editions published in 1968 in English and held by 4 WorldCat member libraries worldwide
Let X sub 1, X sub 2 ... be a sequence of i.i.d. r.v.'s drawn according to an unknown probability measure P. As the data X sub 1, X sub 2 ..., X sub n grows with n, standard likelihood ratio decision procedures yield limiting probabilities of error zero in the twohypothesis test P = P sub 0 vs P = P sub 1. The hypothesistesting problem is investigated here under the constraint that the data must be summarized after each observation by an mvalued statistic. An algorithm with a 4valued statistic is described which achieves a limiting probability of error zero in the twohypothesis testing problem. In common special cases, 2 states are sufficient. Many composite hypothesis tests with close alternatives are easily encompassed within the formulation. (Author)
2 editions published in 1968 in English and held by 4 WorldCat member libraries worldwide
Let X sub 1, X sub 2 ... be a sequence of i.i.d. r.v.'s drawn according to an unknown probability measure P. As the data X sub 1, X sub 2 ..., X sub n grows with n, standard likelihood ratio decision procedures yield limiting probabilities of error zero in the twohypothesis test P = P sub 0 vs P = P sub 1. The hypothesistesting problem is investigated here under the constraint that the data must be summarized after each observation by an mvalued statistic. An algorithm with a 4valued statistic is described which achieves a limiting probability of error zero in the twohypothesis testing problem. In common special cases, 2 states are sufficient. Many composite hypothesis tests with close alternatives are easily encompassed within the formulation. (Author)
Successive refinement of information by
William H. R Equitz(
Book
)
2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We consider a theory of successive refinement, the idea of first approximating data using a few bits of information, then iteratively improving the approximation as more and more information is supplied. The goal is to achieve an optimal description at each stage. In general we seek an ongoing description which is ratedistortion optimal whenever it is interrupted. We show that necessary and sufficient conditions for achieving optimal successive refinement are that the solutions of the ratedistortion problem can be written as a Markov chain. In particular, all finite alphabet signals with Hamming distortion satisfy these requirements
2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We consider a theory of successive refinement, the idea of first approximating data using a few bits of information, then iteratively improving the approximation as more and more information is supplied. The goal is to achieve an optimal description at each stage. In general we seek an ongoing description which is ratedistortion optimal whenever it is interrupted. We show that necessary and sufficient conditions for achieving optimal successive refinement are that the solutions of the ratedistortion problem can be written as a Markov chain. In particular, all finite alphabet signals with Hamming distortion satisfy these requirements
Kolmogorov's contributions to information theory and algorithmic complexity by
T. M Cover(
Book
)
3 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide
3 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide
Optimal finite memory learning algorithms for the finite sample problem by
T. M Cover(
Book
)
3 editions published in 1975 in English and held by 2 WorldCat member libraries worldwide
3 editions published in 1975 in English and held by 2 WorldCat member libraries worldwide
A resolution of the twin paradox from the principle of relativity by
T. M Cover(
Book
)
3 editions published in 1979 in English and held by 2 WorldCat member libraries worldwide
3 editions published in 1979 in English and held by 2 WorldCat member libraries worldwide
Capacity theorems for the relay channel by
T. M Cover(
Book
)
3 editions published in 1977 in English and held by 2 WorldCat member libraries worldwide
3 editions published in 1977 in English and held by 2 WorldCat member libraries worldwide
Universal gambling schemes and the complexity measures of Kolmogorov and Chaitin by
T. M Cover(
Book
)
3 editions published in 1974 in English and held by 2 WorldCat member libraries worldwide
3 editions published in 1974 in English and held by 2 WorldCat member libraries worldwide
A finite memory test of the irrationality of the parameter of a coin by
Stanford University(
Book
)
2 editions published in 1972 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1972 in English and held by 2 WorldCat member libraries worldwide
Multiple access channels with arbitrarily correlated sources by
T. M Cover(
Book
)
3 editions published in 1979 in English and held by 2 WorldCat member libraries worldwide
3 editions published in 1979 in English and held by 2 WorldCat member libraries worldwide
An offensive statistic for baseball by
T. M Cover(
Book
)
3 editions published in 1972 in English and held by 2 WorldCat member libraries worldwide
3 editions published in 1972 in English and held by 2 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Thomas, Joy A.
 Fu, K. S. (King Sun) 19301985 Other Editor
 Gopinath, B. Other Editor
 Stanford University Department of Statistics
 National Science Foundation (U.S.)
 John Wiley & Sons, Inc
 El Gamal, Abbas A. Thesis advisor Author
 United States Air Force Office of Scientific Research
 SPOC
 山本, 博資 1952
Useful Links
Associated Subjects
Automatic speech recognition Binary system (Mathematics) Coding theory Computational complexity Computer science Computer vision Estimation theory Information theory Linear topological spaces Pattern perception Physics Prediction theory Random walks (Mathematics) Rate distortion theory Statistical communication theory Statistical hypothesis testing
Alternative Names
Cover, T. M.
Cover, T. M. 1938
Cover, Thomas M.
Cover, Thomas M. 1938
Cover, Thomas M. 19382012
Cover, Tom 1938
Thomas M. Cover Amerikaans wiskundige (19382012)
Thomas M. Cover amerikansk ingeniør og matematikar
Thomas M. Cover amerikansk ingeniør og matematiker
Thomas M. Cover amerikansk ingenjör och matematiker
Thomas M. Cover USamerikanischer Statistiker
تامس ام. کاور ریاضیدان و مهندس آمریکایی
توماس كوفر
টমাস এম কভার
Languages
Covers