Combinatorial Methods and Models: Rudolf Ahlswede’s Lectures on Information Theory 4 - Couverture souple

Ahlswede, Rudolf

9783319850733: Combinatorial Methods and Models: Rudolf Ahlswede’s Lectures on Information Theory 4

Couverture souple

ISBN 10 : 3319850733 ISBN 13 : 9783319850733

Editeur : Springer, 2018

Afficher les exemplaires de cette �dition comportant l?ISBN

0 D'occasion

7 Neuf

De EUR 90,94

D�tails de l'�dition

�diteurSpringer
Date d'�dition2018
ISBN 10 3319850733
ISBN 13 9783319850733
ReliureBroch�
Langueanglais
Nombre de pages404
�diteurAhlswede Alexander, Alth�fer Ingo, Deppe Christian, Tamm Ulrich

Acheter neuf

Afficher cet article

EUR 90,94

Autre devise

EUR 23 exp�dition depuis Allemagne vers Etats-Unis

Destinations, frais et d�lais

Ajouter au panier

Autres �ditions populaires du m�me titre

9783319531373: Combinatorial Methods and Models: Rudolf Ahlswede s Lectures on Information Theory

Edition pr�sent�e

ISBN 10 : 3319531379 ISBN 13 : 9783319531373
Editeur : Springer International Publishin..., 2017
Couverture rigide

R�sultats de recherche pour Combinatorial Methods and Models: Rudolf Ahlswede’s...

Image fournie par le vendeur

Combinatorial Methods and Models

Rudolf Ahlswede

Edit� par Springer International Publishing Mai 2018, 2018

ISBN 10 : 3319850733 ISBN 13 : 9783319850733

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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.A code can be regarded combinatorially as a hypergraph; and many coding theorems can be obtained by appropriate colourings or coverings of the underlying hypergraphs. Several such colouring and covering techniques and their applications are introduced in this book. Furthermore, codes produced by permutations and one of Ahlswede's favourite research fields -- extremal problems in Combinatorics -- are presented. Whereas the first part of the book concentrates on combinatorial methods in order to analyse classical codes as prefix codes or codes in the Hamming metric, the second is devoted to combinatorial models in Information Theory. Here the code concept already relies on a rather combinatorial structure, as in several concrete models of multiple access channels or more refined distortions. An analytical tool coming into play, especially during the analysis of perfect codes, is the use of orthogonal polynomials.Classical information processing concerns the main tasks of gaining knowledge and the storage, transmission and hiding of data. The first task is the prime goal of Statistics. For transmission and hiding data, Shannon developed an impressive mathematical theory called Information Theory, which he based on probabilistic models. The theory largely involves the concept of codes with small error probabilities in spite of noise in the transmission, which is modeled by channels. The lectures presented in this work are suitable for graduate students in Mathematics, and also for those working in Theoretical Computer Science, Physics, and Electrical Engineering with a background in basic Mathematics. The lectures can be used as the basis for courses or to supplement courses in many ways. Ph.D. students will also find research problems, often with conjectures, that offer potential subjects for a thesis. More advanced researchers may find questions which form the basis of entire research programs. 404 pp. Englisch. N� de r�f. du vendeur 9783319850733

Contacter le vendeur

Acheter neuf

EUR 90,94

Autre devise

Frais de port : EUR 23

De Allemagne vers Etats-Unis

Destinations, frais et d�lais

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Combinatorial Methods and Models : Rudolf Ahlswede�s Lectures on Information Theory 4

Rudolf Ahlswede

Edit� par Springer International Publishing, 2018

ISBN 10 : 3319850733 ISBN 13 : 9783319850733

Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.A code can be regarded combinatorially as a hypergraph; and many coding theorems can be obtained by appropriate colourings or coverings of the underlying hypergraphs. Several such colouring and covering techniques and their applications are introduced in this book. Furthermore, codes produced by permutations and one of Ahlswede's favourite research fields -- extremal problems in Combinatorics -- are presented. Whereas the first part of the book concentrateson combinatorial methods in order to analyse classical codes as prefix codes or codes in the Hamming metric, the second is devoted to combinatorial models in Information Theory. Here the code concept already relies on a rather combinatorial structure, as in several concrete models of multiple access channels or more refined distortions. An analytical tool coming into play, especially during the analysis of perfect codes, is the use of orthogonal polynomials.Classical information processing concerns the main tasks of gaining knowledge and the storage, transmission and hiding of data. The first task is the prime goal of Statistics. For transmission and hiding data, Shannon developed an impressive mathematical theory called Information Theory, which he based on probabilistic models. The theory largely involves the concept of codes with small error probabilities in spite of noise in the transmission, which is modeled by channels. The lectures presentedin this work are suitable for graduate students in Mathematics, and also for those working in Theoretical Computer Science, Physics, and Electrical Engineering with a background in basic Mathematics. The lectures can be used as the basis for courses or to supplement courses in many ways. Ph.D. students will also find research problems, often with conjectures, that offer potential subjects for a thesis. More advanced researchers may find questions which form the basis of entire research programs. N� de r�f. du vendeur 9783319850733

Contacter le vendeur

Acheter neuf

EUR 90,94

Autre devise

Frais de port : EUR 31,47

De Allemagne vers Etats-Unis

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Combinatorial Methods and Models

Rudolf Ahlswede

Edit� par Springer International Publishing, 2018

ISBN 10 : 3319850733 ISBN 13 : 9783319850733

Neuf Couverture souple

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Written by a well-known authorUseful as a self-study guide&nbspIncludes comments from an invited well-known expertRudolf Ahlswede (1938 - 2010) studied Mathematics in Goettingen, and held postdo. N� de r�f. du vendeur 458625389

Contacter le vendeur