Information Theory - Coding Theorems for Discrete Memoryless Systems (Hardcover, 2nd Revised edition)

Csiszar and Koerner's book is widely regarded as a classic in the field of information theory, providing deep insights and expert treatment of the key theoretical issues. It includes in-depth coverage of the mathematics of reliable information transmission, both in two-terminal and multi-terminal network scenarios. Updated and considerably expanded, this new edition presents unique discussions of information theoretic secrecy and of zero-error information theory, including the deep connections of the latter with extremal combinatorics. The presentations of all core subjects are self contained, even the advanced topics, which helps readers to understand the important connections between seemingly different problems. Finally, 320 end-of-chapter problems, together with helpful hints for solving them, allow readers to develop a full command of the mathematical techniques. It is an ideal resource for graduate students and researchers in electrical and electronic engineering, computer science and applied mathematics.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	June 2011
First published:	June 2011
Authors:	Imre Csisz ar • Janos Koerner
Dimensions:	249 x 175 x 28mm (L x W x T)
Format:	Hardcover
Pages:	522
Edition:	2nd Revised edition
ISBN-13:	978-0-521-19681-9
Categories:	Books > Science & Mathematics > Mathematics > Numerical analysis Books > Reference & Interdisciplinary > Communication studies > Information theory > General Books > Professional & Technical > Electronics & communications engineering > Communications engineering / telecommunications > General Promotions
LSN:	0-521-19681-7
Barcode:	9780521196819

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!