國立虎尾科技大學 |

Combinatorial Methods and Models = Rudolf Ahlswede’s Lectures on Information Theory 4 /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Combinatorial Methods and Models/ by Rudolf Ahlswede ; edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm.
Reminder of title:	Rudolf Ahlswede’s Lectures on Information Theory 4 /
Author:	Ahlswede, Rudolf.
other author:	Ahlswede, Alexander.
Description:	XVIII, 385 p. 11 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Combinatorics. -
Online resource:	https://doi.org/10.1007/978-3-319-53139-7
ISBN:	9783319531397

Combinatorial Methods and Models = Rudolf Ahlswede’s Lectures on Information Theory 4 /
Ahlswede, Rudolf.

Combinatorial Methods and ModelsRudolf Ahlswede’s Lectures on Information Theory 4 /[electronic resource] :by Rudolf Ahlswede ; edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm. - 1st ed. 2018. - XVIII, 385 p. 11 illus.online resource. - Foundations in Signal Processing, Communications and Networking,131863-8538 ;. - Foundations in Signal Processing, Communications and Networking,11.

Preface -- I Combinatorial Methods for Information Theory. - II Combinatorial Models in Information Theory. - III Supplement -- Gedenkworte für Rudolf Ahlswede -- Commemorating Rudolf Ahlswede -- Comments by Alon Orlitzky -- Index.

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.

ISBN: 9783319531397

Standard No.: 10.1007/978-3-319-53139-7doiSubjects--Topical Terms:

669353
Combinatorics.

LC Class. No.: QA164-167.2

Dewey Class. No.: 511.6

Combinatorial Methods and Models = Rudolf Ahlswede’s Lectures on Information Theory 4 /
LDR:04193nam a22004095i 4500 001 998988
003 DE-He213
005 20200629225733.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783319531397 $9 978-3-319-53139-7
024 7 $a 10.1007/978-3-319-53139-7 $2 doi
035 $a 978-3-319-53139-7
050 4 $a QA164-167.2
072 7 $a PBV $2 bicssc
072 7 $a MAT036000 $2 bisacsh
072 7 $a PBV $2 thema
082 0 4 $a 511.6 $2 23
100 1 $a Ahlswede, Rudolf. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1064178
245 1 0 $a Combinatorial Methods and Models $h [electronic resource] : $b Rudolf Ahlswede’s Lectures on Information Theory 4 / $c by Rudolf Ahlswede ; edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a XVIII, 385 p. 11 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Foundations in Signal Processing, Communications and Networking, $x 1863-8538 ; $v 13
505 0 $a Preface -- I Combinatorial Methods for Information Theory. - II Combinatorial Models in Information Theory. - III Supplement -- Gedenkworte für Rudolf Ahlswede -- Commemorating Rudolf Ahlswede -- Comments by Alon Orlitzky -- Index.
520 $a 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.
650 0 $a Combinatorics. $3 669353
650 0 $a Information theory. $3 595305
650 2 4 $a Information and Communication, Circuits. $3 671312
700 1 $a Ahlswede, Alexander. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1064179
700 1 $a Althöfer, Ingo. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1258646
700 1 $a Deppe, Christian. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1075188
700 1 $a Tamm, Ulrich. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1258647
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319531373
776 0 8 $i Printed edition: $z 9783319531380
776 0 8 $i Printed edition: $z 9783319850733
830 0 $a Foundations in Signal Processing, Communications and Networking, $x 1863-8538 ; $v 11 $3 1258648
856 4 0 $u https://doi.org/10.1007/978-3-319-53139-7
912 $a ZDB-2-ENG
912 $a ZDB-2-SXE
950 $a Engineering (SpringerNature-11647)
950 $a Engineering (R0) (SpringerNature-43712)