Combinatorial Methods and Models

افزودن به بوکمارک اشتراک گذاری 0 دیدگاه کاربران 5 (0)

Rudolf Ahlswede's Lectures on Information Theory 4

مشارکت: عنوان و توضیح کوتاه هر کتاب را ترجمه کنید این ترجمه بعد از تایید با نام شما در سایت نمایش داده خواهد شد.

ترجمه این کتاب مشاهده همه کتاب های ترجمه نشده

Rudolf Ahlswede's Lectures on Information Theory 4

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.

لغو

گزارش تخلف

مغایرت عنوان کتاب با توضیحات و تصویر جلد
عدم رعایت حقوق نشر طبق قوانین جمهوری اسلامی ایران
محتوای مستهجن
توهین به قومیتها و محتوای نژادپرستی
توهین به اقیلیتهای مذهبی
اهانت به مقامات سیاسی و مذهبی
اشاعه ی کودک آزاری
سایر موارد

بستن

فرمت کتاب

ebook

زبان

english

تاریخ انتشار

2017

نویسنده

Ulrich Tamm

ناشر

Springer

شابک

9783319531373

20,000 تومان

خرید کتاب مطالعه نمونه درخواست ترجمه کتاب

خرید کتاب Combinatorial Methods and Models

Combinatorial Methods and Models

گزارش تخلف

فرمت کتاب

ebook

زبان

english

تاریخ انتشار

2017

نویسنده

ناشر

شابک

کتاب های مرتبط

Metaheuristics for Big Data

Optimal interconnection trees in the plane : theory, algorithms and applications

Cohort Intelligence

Handbook of Combinatorial Optimization

Advances in Steiner Trees

Combinatorial Data Analysis

A Java Library of Graph Algorithms and Optimization

Optimization Algorithms in Physics

Biologically Inspired Optimization Methods

Composite Systems Decisions

Heuristic And Optimization For Knowledge Discovery

Otimização combinatória e programmação linear : modelos e algoritmos

Graphs, networks, and algorithms

Algorithms 23rd Annual European symposium ; proceedings

Combinatorial Optimization Theory and Algorithms

Neo 2016

Combinatorial Methods and Models

Evolve - A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation V

Problems from the Discrete to the Continuous

Combinatorial Optimization

Algorithms - ESA 2015

دیدگاه کاربران