Information Theory Coding Theorems for Discrete Memoryless Systems
Produktdetaljer
Om bidragsyterne
Imre Csiszár is a Research Professor at the Rényi Institute of the Hungarian Academy of Sciences, where he has worked since 1961. He is also Professor Emeritus of the University of Technology and Economics, Budapest, a Fellow of the Institute of Electronic and Electrical Engineers (IEEE) and former President of the Hungarian Mathematical Society. He has received numerous awards, including the Shannon Award of the IEEE Information Theory Society (1996). János Körner is a Professor of Computer Science at the Sapienza University of Rome, where he has worked since 1992. Prior to this, he was a member of the Mathematical Institute of the Hungarian Academy of Sciences for over 20 years, and also worked at AT&T Bell Laboratories, Murray Hill, New Jersey, for two years.'The classic treatise on the fundamental limits of discrete memoryless sources and channels – an indispensable tool for every information theorist.' Segio Verdú, Princeton University, New Jersey
'Information Theory: Coding Theorems for Discrete Memoryless Systems, by Imre Csiszar and Janos Korner, is a classic of modern information theory. 'Classic' since its first edition appeared in 1979. 'Modern' since the mathematical techniques and the results treated are still fundamentally up to date today. This new edition was long overdue. Beyond the original material, it contains two new chapters on zero-error information theory and connections to extremal combinatorics, and on information theoretic security, a topic that has garnered very significant attention in the last few years. This book is an indispensable reference for researchers and graduate students working in the exciting and ever-growing area of information theory.' Giuseppe Caire, University of Southern California
'The first edition of the Csiszar and Korner book on information theory is a classic, in constant use by most mathematically-oriented information theorists. The second edition expands the first with two new chapters, one on zero-error information theory and one on information theoretic security. These use the same consistent set of tools as [the first edition] to organize and prove the central results of these currently important areas. In addition, there are many new problems added to the original chapters, placing many newer research results into a consistent formulation.' Robert Gallager, Massachusetts Institute of Technology
'The field of applied mathematics known as Information Theory owes its origins and early development to three pioneers: Shannon (USA), Kolmogorov (Russia) and Rényi (Hungary). This book, authored by two of Rényi's leading disciples, represents the elegant and precise development of the subject by the Hungarian School. This second edition contains new research of the authors on applications to secrecy theory and zero-error capacity with connections to combinatorial mathematics.' Andrew Viterbi, University of Southern California