國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Combinatorial methods and modelsRudo...

Ahlswede, Alexander.

Combinatorial methods and modelsRudolf Ahlswede's lectures on information theory 4 /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Combinatorial methods and modelsby Rudolf Ahlswede ; edited by Alexander Ahlswede ... [et al.].
其他題名:	Rudolf Ahlswede's lectures on information theory 4 /
作者:	Ahlswede, Rudolf.
其他作者:	Ahlswede, Alexander.
出版者:	Cham :Springer International Publishing :2018.
面頁冊數:	xviii, 385 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Information theory.
電子資源:	http://dx.doi.org/10.1007/978-3-319-53139-7
ISBN:	9783319531397$q(electronic bk.)

Combinatorial methods and modelsRudolf 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 ... [et al.]. - Cham :Springer International Publishing :2018. - xviii, 385 p. :ill., digital ;24 cm. - Foundations in signal processing, communications and networking,v.131863-8538 ;. - Foundations in signal processing, communications and networking ;7..

Preface -- I Combinatorial Methods for Information Theory. - II Combinatorial Models in Information Theory. - III Supplement -- Gedenkworte fur 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$q(electronic bk.)

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

183013
Information theory.

LC Class. No.: Q360

Dewey Class. No.: 003.54

Combinatorial methods and modelsRudolf Ahlswede's lectures on information theory 4 /
LDR:03755nmm a2200325 a 4500 001 526837
003 DE-He213
005 20170701083938.0
006 m d
007 cr nn 008maaau
008 181015s2018 gw s 0 eng d
020 $a 9783319531397$q(electronic bk.)
020 $a 9783319531373$q(paper)
024 7 $a 10.1007/978-3-319-53139-7 $2 doi
035 $a 978-3-319-53139-7
040 $a GP $c GP
041 0 $a eng
050 4 $a Q360
072 7 $a PBV $2 bicssc
072 7 $a MAT036000 $2 bisacsh
082 0 4 $a 003.54 $2 23
090 $a Q360 $b .A285 2018
100 1 $a Ahlswede, Rudolf. $3 280049
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 ... [et al.].
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a xviii, 385 p. : $b ill., digital ; $c 24 cm.
490 1 $a Foundations in signal processing, communications and networking, $x 1863-8538 ; $v v.13
505 0 $a Preface -- I Combinatorial Methods for Information Theory. - II Combinatorial Models in Information Theory. - III Supplement -- Gedenkworte fur 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 Information theory. $3 183013
650 0 $a Combinatorial optimization. $3 185796
650 1 4 $a Mathematics. $3 184409
650 2 4 $a Combinatorics. $3 274788
650 2 4 $a Information and Communication, Circuits. $3 276027
700 1 $a Ahlswede, Alexander. $3 681481
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Foundations in signal processing, communications and networking ; $v 7. $3 558618
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-53139-7
950 $a Engineering (Springer-11647)