000			05163nam a22004575i 4500
999			_c102078 _d102078 _x1
001			102078
003			DE-He213
005			20230102113023.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			170701s2018 gw | s |||| 0|eng d
020			_a9783319531397
024	7		_a10.1007/978-3-319-53139-7 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050			_aQA164 _b.A37 2018 EB
100	1		_aAhlswede, Rudolf _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _1http://viaf.org/viaf/109466553/ _999075
245	1	0	_aCombinatorial Methods and Models _bRudolf Ahlswede's Lectures on Information Theory 4 _cby Rudolf Ahlswede ; edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm.
264		1	_aCham _bSpringer International Publishing _c2018
300			_a1 recurso en línea (XVIII, 385 páginas 11 ilustraciones)
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_atext file _bPDF
490	0		_aFoundations in Signal Processing, Communications and Networking _x1863-8538 _v13
490	0		_aEngineering (Springer-11647)
505	0		_aPreface -- 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	3		_aThe 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.
988			_aEBSPRINGER_2018
650		7	_aAnálisis combinatorio _2embne _9138441
650		7	_aMatemáticas _2embne _9405008
700	1		_aAhlswede, Alexander _eeditor literario _4edt _4http://id.loc.gov/vocabulary/relators/edt _0http://id.loc.gov/authorities/names/nb2014014385 _1http://viaf.org/viaf/86107552/ _999076
700	1		_aAlthöfer, Ingo _eeditor literario _4edt _4http://id.loc.gov/vocabulary/relators/edt _0http://id.loc.gov/authorities/names/n00001844 _1http://viaf.org/viaf/13166298/ _999077
700	1		_aDeppe, Christian _eeditor literario _4edt _4http://id.loc.gov/vocabulary/relators/edt _0http://id.loc.gov/authorities/names/nb2013011795 _1http://viaf.org/viaf/312755327/ _999078
700	1		_aTamm, Ulrich. _eeditor literario _4edt _4http://id.loc.gov/vocabulary/relators/edt _0http://id.loc.gov/authorities/names/nb2014014386 _1http://viaf.org/viaf/309833976/ _999079
776	0	8	_iEdición impresa: _z9783319531373
776	0	8	_iEdición impresa: _z9783319531380
776	0	8	_iEdición impresa: _z9783319850733
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-319-53139-7 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b12/2018 _dz _ef _feng _ggw _h0