Combinatorial Methods and Models (Record no. 80350)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 05095nam a22005655i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-319-53139-7 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20220801222044.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 170701s2018 sz | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783319531397 |
| -- | 978-3-319-53139-7 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 511.1 |
| 100 1# - AUTHOR NAME | |
| Author | Ahlswede, Rudolf. |
| 245 10 - TITLE STATEMENT | |
| Title | Combinatorial Methods and Models |
| Sub Title | Rudolf Ahlswede’s Lectures on Information Theory 4 / |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2018. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XVIII, 385 p. 11 illus. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Foundations in Signal Processing, Communications and Networking, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | 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 ## - SUMMARY, ETC. | |
| Summary, etc | 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. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Ahlswede, Alexander. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Althöfer, Ingo. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Deppe, Christian. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Tamm, Ulrich. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://doi.org/10.1007/978-3-319-53139-7 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer International Publishing : |
| -- | Imprint: Springer, |
| -- | 2018. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Discrete mathematics. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science—Mathematics. |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Discrete Mathematics. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Mathematical Applications in Computer Science. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 1863-8546 ; |
| 912 ## - | |
| -- | ZDB-2-ENG |
| 912 ## - | |
| -- | ZDB-2-SXE |
No items available.