Information theory :: coding theorems for discrete memoryless systems /
Fully updated and revised edition of Csiszár and Körner's classic book on information theory.
Gespeichert in:
1. Verfasser: | |
---|---|
Weitere Verfasser: | |
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Cambridge ; New York :
Cambridge University Press,
2011.
|
Ausgabe: | 2nd ed. |
Schlagworte: | |
Online-Zugang: | Volltext |
Zusammenfassung: | Fully updated and revised edition of Csiszár and Körner's classic book on information theory. |
Beschreibung: | 1 online resource (xxi, 499 pages) : illustrations |
Bibliographie: | Includes bibliographical references (pages 461-477) and indexes. |
ISBN: | 9781139190145 1139190148 1139185241 9781139185240 9780511921889 0511921888 9781139187558 1139187554 1139929801 9781139929806 1107214777 9781107214774 1139180355 9781139180351 1283378361 9781283378369 9786613378361 6613378364 1139188836 9781139188838 1139182927 9781139182928 9781107565043 1107565049 |
Internformat
MARC
LEADER | 00000cam a2200000 a 4500 | ||
---|---|---|---|
001 | ZDB-4-EBA-ocn773040613 | ||
003 | OCoLC | ||
005 | 20241004212047.0 | ||
006 | m o d | ||
007 | cr cnu---unuuu | ||
008 | 120117s2011 enka ob 001 0 eng d | ||
040 | |a N$T |b eng |e pn |c N$T |d YDXCP |d CDX |d E7B |d OCLCQ |d CAMBR |d OCLCQ |d OCLCF |d OCLCQ |d EBLCP |d DEBSZ |d OCL |d OCLCQ |d COCUF |d STF |d CUY |d MERUC |d ZCU |d ICG |d K6U |d LOA |d VT2 |d U3W |d OCLCQ |d WYU |d LVT |d TKN |d DKC |d AGLDB |d SNK |d OCLCQ |d UKAHL |d OCLCQ |d A6Q |d G3B |d OCLCQ |d AU@ |d UKCRE |d OCLCQ |d VLY |d MM9 |d LUN |d AJS |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d S9M |d OCLCL |d OCLCQ | ||
016 | 7 | |a 015678658 |2 Uk | |
019 | |a 769628632 |a 782876934 |a 817913092 |a 1042899730 |a 1043681184 |a 1058872995 |a 1061026927 |a 1065747019 |a 1066455506 |a 1076702284 |a 1081190873 |a 1097166670 |a 1153523320 |a 1162305981 |a 1170506706 |a 1170901437 |a 1171381064 |a 1228554321 |a 1241934392 |a 1259110911 | ||
020 | |a 9781139190145 |q (electronic bk.) | ||
020 | |a 1139190148 |q (electronic bk.) | ||
020 | |a 1139185241 |q (electronic bk.) | ||
020 | |a 9781139185240 |q (electronic bk.) | ||
020 | |a 9780511921889 |q (electronic bk.) | ||
020 | |a 0511921888 |q (electronic bk.) | ||
020 | |a 9781139187558 | ||
020 | |a 1139187554 | ||
020 | |a 1139929801 | ||
020 | |a 9781139929806 | ||
020 | |a 1107214777 | ||
020 | |a 9781107214774 | ||
020 | |a 1139180355 | ||
020 | |a 9781139180351 | ||
020 | |a 1283378361 | ||
020 | |a 9781283378369 | ||
020 | |a 9786613378361 | ||
020 | |a 6613378364 | ||
020 | |a 1139188836 | ||
020 | |a 9781139188838 | ||
020 | |a 1139182927 | ||
020 | |a 9781139182928 | ||
020 | |a 9781107565043 |q (paperback) | ||
020 | |a 1107565049 | ||
020 | |z 9780521196819 | ||
020 | |z 0521196817 | ||
035 | |a (OCoLC)773040613 |z (OCoLC)769628632 |z (OCoLC)782876934 |z (OCoLC)817913092 |z (OCoLC)1042899730 |z (OCoLC)1043681184 |z (OCoLC)1058872995 |z (OCoLC)1061026927 |z (OCoLC)1065747019 |z (OCoLC)1066455506 |z (OCoLC)1076702284 |z (OCoLC)1081190873 |z (OCoLC)1097166670 |z (OCoLC)1153523320 |z (OCoLC)1162305981 |z (OCoLC)1170506706 |z (OCoLC)1170901437 |z (OCoLC)1171381064 |z (OCoLC)1228554321 |z (OCoLC)1241934392 |z (OCoLC)1259110911 | ||
050 | 4 | |a QA268 |b .C79 2011eb | |
072 | 7 | |a MAT |x 041000 |2 bisacsh | |
082 | 7 | |a 518 |2 22 | |
049 | |a MAIN | ||
100 | 1 | |a Csiszár, Imre, |d 1938- |1 https://id.oclc.org/worldcat/entity/E39PBJf4gVCP6kGwFb39689CcP |0 http://id.loc.gov/authorities/names/n97046827 | |
245 | 1 | 0 | |a Information theory : |b coding theorems for discrete memoryless systems / |c Imre Csiszár, János Körner. |
250 | |a 2nd ed. | ||
260 | |a Cambridge ; |a New York : |b Cambridge University Press, |c 2011. | ||
300 | |a 1 online resource (xxi, 499 pages) : |b illustrations | ||
336 | |a text |b txt |2 rdacontent | ||
337 | |a computer |b c |2 rdamedia | ||
338 | |a online resource |b cr |2 rdacarrier | ||
347 | |a data file | ||
504 | |a Includes bibliographical references (pages 461-477) and indexes. | ||
588 | 0 | |a Print version record. | |
505 | 0 | |a Cover; Information Theory; Title; Copyright; Contents; Preface to the first edition; Preface to the second edition; Basic notation and conventions; Preliminaries on random variables and probability distributions; Introduction; Intuitive background; Informal description of the basic mathematical model; Measuring information; Multi-terminal systems; Part I Information measures in simple coding problems; 1 Source coding and hypothesis testing; information measures; Discussion; Problems; Postulational characterizations of entropy (Problems 1.11-1.14); Story of the results. | |
505 | 8 | |a 2 Types and typical sequencesDiscussion; Problems; Story of the results; 3 Formal properties of Shannon's information measures; Problems; Properties of informational divergence (Problems 3.17-3.20); Structural results on entropy (Problems 3.21-3.22); Story of the results; 4 Non-block source coding; Problems; General noiseless channels (Problems 4.20-4.22); Universal variable-length codes (Problems 4.23-4.26); Story of the results; 5 Blowing up lemma: a combinatorial digression; Problems; Story of the results; Part II Two-terminal systems; 6 The noisy channel coding problem; Discussion. | |
505 | 8 | |a ProblemsComparison of channels (Problems 6.16-6.18); Zero-error capacity and graphs (Problems 6.23-6.25); Story of the results; 7 Rate-distortion trade-off in source coding and the source-channel transmission problem; Discussion; Problems; Story of the results; 8 Computation of channel capacity and?-distortion rates; Problems; Story of the results; 9 A covering lemma and the error exponent in source coding; Problems; Graph entropy and convex corners; Story of the results; 10 A packing lemma and the error exponent in channel coding; Discussion; Problems; Compound DMCs (Problems 10.12-10.14). | |
505 | 8 | |a Reliability at R = 0 (Problems 10.20-10.23)Story of the results; 11 The compound channel revisited: zero-error information theory and extremal combinatorics; Discussion; Problems; Story of the results; 12 Arbitrarily varying channels; Discussion; Problems; Story of the results; Part III Multi-terminal systems; 13 Separate coding of correlated sources; Discussion; Problems; Story of the results; 14 Multiple-access channels; Discussion; Problems; Reduction of channel network problems (Problems 14.22-14.24); Story of the results; 15 Entropy and image size characterization; Discussion; Problems. | |
505 | 8 | |a Image size of arbitrary sets (Problems 15.4-15.5)More-than-three-component sources (Problems 15.16-15.21); Story of the results; 16 Source and channel networks; Discussion; Problems; Broadcast channels (Problems 16.8-16.12); Source networks with three inputs and one helper (Problems 16.13-16.18); Source networks with two helpers; General fidelity criteria (Problems 16.22-16.24); Common information (Problems 16.27-16.30); Miscellaneous source networks (Problems 16.31-16.33); Story of the results; 17 Information-theoretic security; 17.1 Basic concepts and tools. | |
520 | |a Fully updated and revised edition of Csiszár and Körner's classic book on information theory. | ||
546 | |a English. | ||
650 | 0 | |a Coding theory. |0 http://id.loc.gov/authorities/subjects/sh85027654 | |
650 | 7 | |a MATHEMATICS |x Numerical Analysis. |2 bisacsh | |
650 | 7 | |a Análisis numérico |2 embne | |
650 | 0 | 7 | |a Codificación, Teoría de |2 embucm |
650 | 7 | |a Coding theory |2 fast | |
655 | 7 | |a Textbooks |2 fast | |
700 | 1 | |a Körner, János. | |
776 | 0 | 8 | |i Print version: |a Csiszár, Imre, 1938- |t Information theory. |b 2nd ed. |d Cambridge ; New York : Cambridge University Press, 2011 |z 9780521196819 |w (DLC) 2011293266 |w (OCoLC)668195770 |
856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=409029 |3 Volltext |
938 | |a Askews and Holts Library Services |b ASKH |n AH21918582 | ||
938 | |a Askews and Holts Library Services |b ASKH |n AH37562767 | ||
938 | |a Askews and Holts Library Services |b ASKH |n AH33351664 | ||
938 | |a Coutts Information Services |b COUT |n 20448555 | ||
938 | |a EBL - Ebook Library |b EBLB |n EBL807257 | ||
938 | |a ebrary |b EBRY |n ebr10520688 | ||
938 | |a EBSCOhost |b EBSC |n 409029 | ||
938 | |a YBP Library Services |b YANK |n 7408117 | ||
938 | |a YBP Library Services |b YANK |n 7308071 | ||
938 | |a YBP Library Services |b YANK |n 9619706 | ||
938 | |a YBP Library Services |b YANK |n 7571831 | ||
994 | |a 92 |b GEBAY | ||
912 | |a ZDB-4-EBA | ||
049 | |a DE-863 |
Datensatz im Suchindex
DE-BY-FWS_katkey | ZDB-4-EBA-ocn773040613 |
---|---|
_version_ | 1816881783471341568 |
adam_text | |
any_adam_object | |
author | Csiszár, Imre, 1938- |
author2 | Körner, János |
author2_role | |
author2_variant | j k jk |
author_GND | http://id.loc.gov/authorities/names/n97046827 |
author_facet | Csiszár, Imre, 1938- Körner, János |
author_role | |
author_sort | Csiszár, Imre, 1938- |
author_variant | i c ic |
building | Verbundindex |
bvnumber | localFWS |
callnumber-first | Q - Science |
callnumber-label | QA268 |
callnumber-raw | QA268 .C79 2011eb |
callnumber-search | QA268 .C79 2011eb |
callnumber-sort | QA 3268 C79 42011EB |
callnumber-subject | QA - Mathematics |
collection | ZDB-4-EBA |
contents | Cover; Information Theory; Title; Copyright; Contents; Preface to the first edition; Preface to the second edition; Basic notation and conventions; Preliminaries on random variables and probability distributions; Introduction; Intuitive background; Informal description of the basic mathematical model; Measuring information; Multi-terminal systems; Part I Information measures in simple coding problems; 1 Source coding and hypothesis testing; information measures; Discussion; Problems; Postulational characterizations of entropy (Problems 1.11-1.14); Story of the results. 2 Types and typical sequencesDiscussion; Problems; Story of the results; 3 Formal properties of Shannon's information measures; Problems; Properties of informational divergence (Problems 3.17-3.20); Structural results on entropy (Problems 3.21-3.22); Story of the results; 4 Non-block source coding; Problems; General noiseless channels (Problems 4.20-4.22); Universal variable-length codes (Problems 4.23-4.26); Story of the results; 5 Blowing up lemma: a combinatorial digression; Problems; Story of the results; Part II Two-terminal systems; 6 The noisy channel coding problem; Discussion. ProblemsComparison of channels (Problems 6.16-6.18); Zero-error capacity and graphs (Problems 6.23-6.25); Story of the results; 7 Rate-distortion trade-off in source coding and the source-channel transmission problem; Discussion; Problems; Story of the results; 8 Computation of channel capacity and?-distortion rates; Problems; Story of the results; 9 A covering lemma and the error exponent in source coding; Problems; Graph entropy and convex corners; Story of the results; 10 A packing lemma and the error exponent in channel coding; Discussion; Problems; Compound DMCs (Problems 10.12-10.14). Reliability at R = 0 (Problems 10.20-10.23)Story of the results; 11 The compound channel revisited: zero-error information theory and extremal combinatorics; Discussion; Problems; Story of the results; 12 Arbitrarily varying channels; Discussion; Problems; Story of the results; Part III Multi-terminal systems; 13 Separate coding of correlated sources; Discussion; Problems; Story of the results; 14 Multiple-access channels; Discussion; Problems; Reduction of channel network problems (Problems 14.22-14.24); Story of the results; 15 Entropy and image size characterization; Discussion; Problems. Image size of arbitrary sets (Problems 15.4-15.5)More-than-three-component sources (Problems 15.16-15.21); Story of the results; 16 Source and channel networks; Discussion; Problems; Broadcast channels (Problems 16.8-16.12); Source networks with three inputs and one helper (Problems 16.13-16.18); Source networks with two helpers; General fidelity criteria (Problems 16.22-16.24); Common information (Problems 16.27-16.30); Miscellaneous source networks (Problems 16.31-16.33); Story of the results; 17 Information-theoretic security; 17.1 Basic concepts and tools. |
ctrlnum | (OCoLC)773040613 |
dewey-full | 518 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 518 - Numerical analysis |
dewey-raw | 518 |
dewey-search | 518 |
dewey-sort | 3518 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
edition | 2nd ed. |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>07337cam a2200973 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn773040613</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">120117s2011 enka ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">YDXCP</subfield><subfield code="d">CDX</subfield><subfield code="d">E7B</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CAMBR</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">EBLCP</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">COCUF</subfield><subfield code="d">STF</subfield><subfield code="d">CUY</subfield><subfield code="d">MERUC</subfield><subfield code="d">ZCU</subfield><subfield code="d">ICG</subfield><subfield code="d">K6U</subfield><subfield code="d">LOA</subfield><subfield code="d">VT2</subfield><subfield code="d">U3W</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">WYU</subfield><subfield code="d">LVT</subfield><subfield code="d">TKN</subfield><subfield code="d">DKC</subfield><subfield code="d">AGLDB</subfield><subfield code="d">SNK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">A6Q</subfield><subfield code="d">G3B</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AU@</subfield><subfield code="d">UKCRE</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VLY</subfield><subfield code="d">MM9</subfield><subfield code="d">LUN</subfield><subfield code="d">AJS</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">S9M</subfield><subfield code="d">OCLCL</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">015678658</subfield><subfield code="2">Uk</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">769628632</subfield><subfield code="a">782876934</subfield><subfield code="a">817913092</subfield><subfield code="a">1042899730</subfield><subfield code="a">1043681184</subfield><subfield code="a">1058872995</subfield><subfield code="a">1061026927</subfield><subfield code="a">1065747019</subfield><subfield code="a">1066455506</subfield><subfield code="a">1076702284</subfield><subfield code="a">1081190873</subfield><subfield code="a">1097166670</subfield><subfield code="a">1153523320</subfield><subfield code="a">1162305981</subfield><subfield code="a">1170506706</subfield><subfield code="a">1170901437</subfield><subfield code="a">1171381064</subfield><subfield code="a">1228554321</subfield><subfield code="a">1241934392</subfield><subfield code="a">1259110911</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139190145</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139190148</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139185241</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139185240</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511921889</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511921888</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139187558</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139187554</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139929801</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139929806</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107214777</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107214774</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139180355</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139180351</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1283378361</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781283378369</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786613378361</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">6613378364</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139188836</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139188838</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1139182927</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139182928</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107565043</subfield><subfield code="q">(paperback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107565049</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521196819</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521196817</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)773040613</subfield><subfield code="z">(OCoLC)769628632</subfield><subfield code="z">(OCoLC)782876934</subfield><subfield code="z">(OCoLC)817913092</subfield><subfield code="z">(OCoLC)1042899730</subfield><subfield code="z">(OCoLC)1043681184</subfield><subfield code="z">(OCoLC)1058872995</subfield><subfield code="z">(OCoLC)1061026927</subfield><subfield code="z">(OCoLC)1065747019</subfield><subfield code="z">(OCoLC)1066455506</subfield><subfield code="z">(OCoLC)1076702284</subfield><subfield code="z">(OCoLC)1081190873</subfield><subfield code="z">(OCoLC)1097166670</subfield><subfield code="z">(OCoLC)1153523320</subfield><subfield code="z">(OCoLC)1162305981</subfield><subfield code="z">(OCoLC)1170506706</subfield><subfield code="z">(OCoLC)1170901437</subfield><subfield code="z">(OCoLC)1171381064</subfield><subfield code="z">(OCoLC)1228554321</subfield><subfield code="z">(OCoLC)1241934392</subfield><subfield code="z">(OCoLC)1259110911</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA268</subfield><subfield code="b">.C79 2011eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">041000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">518</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Csiszár, Imre,</subfield><subfield code="d">1938-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJf4gVCP6kGwFb39689CcP</subfield><subfield code="0">http://id.loc.gov/authorities/names/n97046827</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Information theory :</subfield><subfield code="b">coding theorems for discrete memoryless systems /</subfield><subfield code="c">Imre Csiszár, János Körner.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2nd ed.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">2011.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xxi, 499 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">data file</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 461-477) and indexes.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Cover; Information Theory; Title; Copyright; Contents; Preface to the first edition; Preface to the second edition; Basic notation and conventions; Preliminaries on random variables and probability distributions; Introduction; Intuitive background; Informal description of the basic mathematical model; Measuring information; Multi-terminal systems; Part I Information measures in simple coding problems; 1 Source coding and hypothesis testing; information measures; Discussion; Problems; Postulational characterizations of entropy (Problems 1.11-1.14); Story of the results.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">2 Types and typical sequencesDiscussion; Problems; Story of the results; 3 Formal properties of Shannon's information measures; Problems; Properties of informational divergence (Problems 3.17-3.20); Structural results on entropy (Problems 3.21-3.22); Story of the results; 4 Non-block source coding; Problems; General noiseless channels (Problems 4.20-4.22); Universal variable-length codes (Problems 4.23-4.26); Story of the results; 5 Blowing up lemma: a combinatorial digression; Problems; Story of the results; Part II Two-terminal systems; 6 The noisy channel coding problem; Discussion.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">ProblemsComparison of channels (Problems 6.16-6.18); Zero-error capacity and graphs (Problems 6.23-6.25); Story of the results; 7 Rate-distortion trade-off in source coding and the source-channel transmission problem; Discussion; Problems; Story of the results; 8 Computation of channel capacity and?-distortion rates; Problems; Story of the results; 9 A covering lemma and the error exponent in source coding; Problems; Graph entropy and convex corners; Story of the results; 10 A packing lemma and the error exponent in channel coding; Discussion; Problems; Compound DMCs (Problems 10.12-10.14).</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Reliability at R = 0 (Problems 10.20-10.23)Story of the results; 11 The compound channel revisited: zero-error information theory and extremal combinatorics; Discussion; Problems; Story of the results; 12 Arbitrarily varying channels; Discussion; Problems; Story of the results; Part III Multi-terminal systems; 13 Separate coding of correlated sources; Discussion; Problems; Story of the results; 14 Multiple-access channels; Discussion; Problems; Reduction of channel network problems (Problems 14.22-14.24); Story of the results; 15 Entropy and image size characterization; Discussion; Problems.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Image size of arbitrary sets (Problems 15.4-15.5)More-than-three-component sources (Problems 15.16-15.21); Story of the results; 16 Source and channel networks; Discussion; Problems; Broadcast channels (Problems 16.8-16.12); Source networks with three inputs and one helper (Problems 16.13-16.18); Source networks with two helpers; General fidelity criteria (Problems 16.22-16.24); Common information (Problems 16.27-16.30); Miscellaneous source networks (Problems 16.31-16.33); Story of the results; 17 Information-theoretic security; 17.1 Basic concepts and tools.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Fully updated and revised edition of Csiszár and Körner's classic book on information theory.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Coding theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85027654</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Numerical Analysis.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Análisis numérico</subfield><subfield code="2">embne</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Codificación, Teoría de</subfield><subfield code="2">embucm</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Coding theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Textbooks</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Körner, János.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Csiszár, Imre, 1938-</subfield><subfield code="t">Information theory.</subfield><subfield code="b">2nd ed.</subfield><subfield code="d">Cambridge ; New York : Cambridge University Press, 2011</subfield><subfield code="z">9780521196819</subfield><subfield code="w">(DLC) 2011293266</subfield><subfield code="w">(OCoLC)668195770</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=409029</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH21918582</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH37562767</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH33351664</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Coutts Information Services</subfield><subfield code="b">COUT</subfield><subfield code="n">20448555</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBL - Ebook Library</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL807257</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10520688</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">409029</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7408117</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7308071</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">9619706</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7571831</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
genre | Textbooks fast |
genre_facet | Textbooks |
id | ZDB-4-EBA-ocn773040613 |
illustrated | Illustrated |
indexdate | 2024-11-27T13:18:12Z |
institution | BVB |
isbn | 9781139190145 1139190148 1139185241 9781139185240 9780511921889 0511921888 9781139187558 1139187554 1139929801 9781139929806 1107214777 9781107214774 1139180355 9781139180351 1283378361 9781283378369 9786613378361 6613378364 1139188836 9781139188838 1139182927 9781139182928 9781107565043 1107565049 |
language | English |
oclc_num | 773040613 |
open_access_boolean | |
owner | MAIN DE-863 DE-BY-FWS |
owner_facet | MAIN DE-863 DE-BY-FWS |
physical | 1 online resource (xxi, 499 pages) : illustrations |
psigel | ZDB-4-EBA |
publishDate | 2011 |
publishDateSearch | 2011 |
publishDateSort | 2011 |
publisher | Cambridge University Press, |
record_format | marc |
spelling | Csiszár, Imre, 1938- https://id.oclc.org/worldcat/entity/E39PBJf4gVCP6kGwFb39689CcP http://id.loc.gov/authorities/names/n97046827 Information theory : coding theorems for discrete memoryless systems / Imre Csiszár, János Körner. 2nd ed. Cambridge ; New York : Cambridge University Press, 2011. 1 online resource (xxi, 499 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier data file Includes bibliographical references (pages 461-477) and indexes. Print version record. Cover; Information Theory; Title; Copyright; Contents; Preface to the first edition; Preface to the second edition; Basic notation and conventions; Preliminaries on random variables and probability distributions; Introduction; Intuitive background; Informal description of the basic mathematical model; Measuring information; Multi-terminal systems; Part I Information measures in simple coding problems; 1 Source coding and hypothesis testing; information measures; Discussion; Problems; Postulational characterizations of entropy (Problems 1.11-1.14); Story of the results. 2 Types and typical sequencesDiscussion; Problems; Story of the results; 3 Formal properties of Shannon's information measures; Problems; Properties of informational divergence (Problems 3.17-3.20); Structural results on entropy (Problems 3.21-3.22); Story of the results; 4 Non-block source coding; Problems; General noiseless channels (Problems 4.20-4.22); Universal variable-length codes (Problems 4.23-4.26); Story of the results; 5 Blowing up lemma: a combinatorial digression; Problems; Story of the results; Part II Two-terminal systems; 6 The noisy channel coding problem; Discussion. ProblemsComparison of channels (Problems 6.16-6.18); Zero-error capacity and graphs (Problems 6.23-6.25); Story of the results; 7 Rate-distortion trade-off in source coding and the source-channel transmission problem; Discussion; Problems; Story of the results; 8 Computation of channel capacity and?-distortion rates; Problems; Story of the results; 9 A covering lemma and the error exponent in source coding; Problems; Graph entropy and convex corners; Story of the results; 10 A packing lemma and the error exponent in channel coding; Discussion; Problems; Compound DMCs (Problems 10.12-10.14). Reliability at R = 0 (Problems 10.20-10.23)Story of the results; 11 The compound channel revisited: zero-error information theory and extremal combinatorics; Discussion; Problems; Story of the results; 12 Arbitrarily varying channels; Discussion; Problems; Story of the results; Part III Multi-terminal systems; 13 Separate coding of correlated sources; Discussion; Problems; Story of the results; 14 Multiple-access channels; Discussion; Problems; Reduction of channel network problems (Problems 14.22-14.24); Story of the results; 15 Entropy and image size characterization; Discussion; Problems. Image size of arbitrary sets (Problems 15.4-15.5)More-than-three-component sources (Problems 15.16-15.21); Story of the results; 16 Source and channel networks; Discussion; Problems; Broadcast channels (Problems 16.8-16.12); Source networks with three inputs and one helper (Problems 16.13-16.18); Source networks with two helpers; General fidelity criteria (Problems 16.22-16.24); Common information (Problems 16.27-16.30); Miscellaneous source networks (Problems 16.31-16.33); Story of the results; 17 Information-theoretic security; 17.1 Basic concepts and tools. Fully updated and revised edition of Csiszár and Körner's classic book on information theory. English. Coding theory. http://id.loc.gov/authorities/subjects/sh85027654 MATHEMATICS Numerical Analysis. bisacsh Análisis numérico embne Codificación, Teoría de embucm Coding theory fast Textbooks fast Körner, János. Print version: Csiszár, Imre, 1938- Information theory. 2nd ed. Cambridge ; New York : Cambridge University Press, 2011 9780521196819 (DLC) 2011293266 (OCoLC)668195770 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=409029 Volltext |
spellingShingle | Csiszár, Imre, 1938- Information theory : coding theorems for discrete memoryless systems / Cover; Information Theory; Title; Copyright; Contents; Preface to the first edition; Preface to the second edition; Basic notation and conventions; Preliminaries on random variables and probability distributions; Introduction; Intuitive background; Informal description of the basic mathematical model; Measuring information; Multi-terminal systems; Part I Information measures in simple coding problems; 1 Source coding and hypothesis testing; information measures; Discussion; Problems; Postulational characterizations of entropy (Problems 1.11-1.14); Story of the results. 2 Types and typical sequencesDiscussion; Problems; Story of the results; 3 Formal properties of Shannon's information measures; Problems; Properties of informational divergence (Problems 3.17-3.20); Structural results on entropy (Problems 3.21-3.22); Story of the results; 4 Non-block source coding; Problems; General noiseless channels (Problems 4.20-4.22); Universal variable-length codes (Problems 4.23-4.26); Story of the results; 5 Blowing up lemma: a combinatorial digression; Problems; Story of the results; Part II Two-terminal systems; 6 The noisy channel coding problem; Discussion. ProblemsComparison of channels (Problems 6.16-6.18); Zero-error capacity and graphs (Problems 6.23-6.25); Story of the results; 7 Rate-distortion trade-off in source coding and the source-channel transmission problem; Discussion; Problems; Story of the results; 8 Computation of channel capacity and?-distortion rates; Problems; Story of the results; 9 A covering lemma and the error exponent in source coding; Problems; Graph entropy and convex corners; Story of the results; 10 A packing lemma and the error exponent in channel coding; Discussion; Problems; Compound DMCs (Problems 10.12-10.14). Reliability at R = 0 (Problems 10.20-10.23)Story of the results; 11 The compound channel revisited: zero-error information theory and extremal combinatorics; Discussion; Problems; Story of the results; 12 Arbitrarily varying channels; Discussion; Problems; Story of the results; Part III Multi-terminal systems; 13 Separate coding of correlated sources; Discussion; Problems; Story of the results; 14 Multiple-access channels; Discussion; Problems; Reduction of channel network problems (Problems 14.22-14.24); Story of the results; 15 Entropy and image size characterization; Discussion; Problems. Image size of arbitrary sets (Problems 15.4-15.5)More-than-three-component sources (Problems 15.16-15.21); Story of the results; 16 Source and channel networks; Discussion; Problems; Broadcast channels (Problems 16.8-16.12); Source networks with three inputs and one helper (Problems 16.13-16.18); Source networks with two helpers; General fidelity criteria (Problems 16.22-16.24); Common information (Problems 16.27-16.30); Miscellaneous source networks (Problems 16.31-16.33); Story of the results; 17 Information-theoretic security; 17.1 Basic concepts and tools. Coding theory. http://id.loc.gov/authorities/subjects/sh85027654 MATHEMATICS Numerical Analysis. bisacsh Análisis numérico embne Codificación, Teoría de embucm Coding theory fast |
subject_GND | http://id.loc.gov/authorities/subjects/sh85027654 |
title | Information theory : coding theorems for discrete memoryless systems / |
title_auth | Information theory : coding theorems for discrete memoryless systems / |
title_exact_search | Information theory : coding theorems for discrete memoryless systems / |
title_full | Information theory : coding theorems for discrete memoryless systems / Imre Csiszár, János Körner. |
title_fullStr | Information theory : coding theorems for discrete memoryless systems / Imre Csiszár, János Körner. |
title_full_unstemmed | Information theory : coding theorems for discrete memoryless systems / Imre Csiszár, János Körner. |
title_short | Information theory : |
title_sort | information theory coding theorems for discrete memoryless systems |
title_sub | coding theorems for discrete memoryless systems / |
topic | Coding theory. http://id.loc.gov/authorities/subjects/sh85027654 MATHEMATICS Numerical Analysis. bisacsh Análisis numérico embne Codificación, Teoría de embucm Coding theory fast |
topic_facet | Coding theory. MATHEMATICS Numerical Analysis. Análisis numérico Codificación, Teoría de Coding theory Textbooks |
url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=409029 |
work_keys_str_mv | AT csiszarimre informationtheorycodingtheoremsfordiscretememorylesssystems AT kornerjanos informationtheorycodingtheoremsfordiscretememorylesssystems |