Posted by **AvaxGenius** at Sept. 16, 2017

English | PDF | 2017 (2018 Edition) | 341 Pages | ISBN : 3319639455 | 9.27 MB

This book presents the proceedings of Workshops and Posters at the 13th International Conference on Spatial Information Theory (COSIT 2017), which is concerned with all aspects of space and spatial environments as experienced, represented and elaborated by humans, other animals and artificial agents.

Posted by **AvaxGenius** at July 29, 2017

English | PDF | 2013 | 187 Pages | ISBN : 938025041X | 11.43 MB

The logarithmic connection between entropy and probability was first enun- ciated by L.E. Boltzmann (1844-1906) in his kinetic theory of gases. His famous formula for entropy S is S = k log W (as engraved on his tombstone in Vienna) where k is a constant and W is the number of possible microstates corresponding to the macroscopic state of a system of particles in agas.

Posted by **AvaxGenius** at July 24, 2017

English | PDF | 2018 | 395 Pages | ISBN : 3319531379 | 4.85 MB

The fourth volume of Rudolf Ahlswede’s lectures on Information Theory is focused on Combinatorics. Ahlswede was originally motivated to study combinatorial aspects of Information Theory via zero-error codes: in this case the structure of the coding problems usually drastically changes from probabilistic to combinatorial. The best example is Shannon’s zero error capacity, where independent sets in graphs have to be examined. The extension to multiple access channels leads to the Zarankiewicz problem.

Posted by **nebulae** at July 22, 2017

English | ISBN: 9814759236 | 2016 | 412 pages | PDF | 3 MB

Posted by **AvaxGenius** at July 15, 2017

The fourth volume of Rudolf Ahlswede’s lectures on Information Theory is focused on Combinatorics. Ahlswede was originally motivated to study combinatorial aspects of Information Theory via zero-error codes: in this case the structure of the coding problems usually drastically changes from probabilistic to combinatorial. The best example is Shannon’s zero error capacity, where independent sets in graphs have to be examined. The extension to multiple access channels leads to the Zarankiewicz problem.

Posted by **roxul** at July 10, 2017

2000 | ISBN-10: 9810237111 | 220 pages | PDF | 15 MB

Posted by **AvaxGenius** at July 1, 2017

English | PDF | 2018 | 395 Pages | ISBN : 3319531379 | 4.85 MB

The fourth volume of Rudolf Ahlswede’s lectures on Information Theory is focused on Combinatorics. Ahlswede was originally motivated to study combinatorial aspects of Information Theory via zero-error codes: in this case the structure of the coding problems usually drastically changes from probabilistic to combinatorial. The best example is Shannon’s zero error capacity, where independent sets in graphs have to be examined. The extension to multiple access channels leads to the Zarankiewicz problem.

Posted by **libr** at June 21, 2017

English | 2012 | ISBN-10: 0521516501 | 346 pages | PDF | 2,7 MB

Posted by **step778** at May 17, 2017

2005 | pages: 511 | ISBN: 0471748676 | PDF | 5,3 mb

Posted by **nebulae** at May 15, 2017

English | ISBN: 3662497239 | 2017 | 680 pages | PDF | 7 MB