Combinatorial methods and models
135,33 $

Combinatorial methods and models

RUDOLF AHLSWEDE


Combinatorial methods and models

RUDOLF AHLSWEDE

135,33 $ 135,33 $
Régulier: 135,33 $
Rabais: 0,00 $ (0%)
Livre numérique non disponible
Résumé

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.




Détails
Titre
Combinatorial methods and models
Prix
135,33 $
Sujet
Format Poche
Non
Langue
Français/French
Date de publication
2017-06-30
ISBN
9783319531397
Code Interne
2273226
Numéro de produit
2273226
Format numérique
pdf
Disponibilité
AD AE AM AQ AR AS AT AU AX BA BB BE BG BH BL BM BN BO BR BS BV BZ CA CH CK CL CN CO CR CU CW CX CY CZ DE DK DM DO DZ EC EE ES FI FK FO FR GB GD GF GG GI GL GP GR GT GY HK HM HN HR HT HU ID IE IL IM IN IO IR IS IT JE JM JP KH KM KN KR KY LA LB LC LI L
Protection
Adobe DRM
Entrepôt Numérique
NUMILOG

Notre conseil

Avant de vous déplacer, nous vous recommandons de téléphoner au magasin pour vérifier le stock.

Ville: (Changer).

exemplaire(s)
Ce produit est actuellement non disponible en magasin.
Nous n'avons pas pu trouver une succursale pour le code postal donné. Veuillez en essayer un autre.