Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Introduction Kapitel lesen Erstes Kapitel lesen

2014 | OriginalPaper | Buchkapitel

6. Towards Capacity Functions

verfasst von : Rudolf Ahlswede, Alexander Ahlswede, Ingo Althöfer, Christian Deppe, Ulrich Tamm

Erschienen in: Storing and Transmitting Data

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Among the mostly investigated parameters for noisy channels are code size, error probability in decoding, block length; rate, capacity, reliability function; delay, complexity of coding. There are several statements about connections between these quantities. They carry names like “coding theorem”, “converse theorem” (weak, strong, ...), “direct theorem”, “capacity theorem”, “lower bound”, “upper bound”, etc. There are analogous notions for source coding.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Coding Theorems and Converses for the DMC
Nächstes Kapitel Error Bounds
Anhänge
Nur mit Berechtigung zugänglich
Literatur
1.
R. Ahlswede, Certain results in coding theory for compound channels. in Proceedings of the Colloquium Information Theory (Debrecen, Hungary, 1967), pp. 35–60
2.
R. Ahlswede, Beiträge zur Shannonschen Informationstheorie im Fall nichtstationärer Kanäle, Z. Wahrscheinlichkeitstheorie und verw. Geb. 10, 1–42 (1968) (Diploma Thesis Nichtstationäre Kanäle, Göttingen 1963).
3.
4.
R. Ahlswede, Multi-way communication channels, in Proceedings of 2nd International Symposium on Information Theory, Thakadsor, Armenian SSR, September 1971 (Akademiai Kiado, Budapest, 1973), pp. 23–52
5.
6.
R. Ahlswede, in textitOn Concepts of Performance Parameters for Channels, General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol. 4123 (Springer, 2006), pp. 639–663
7.
R. Ahlswede, General theory of information transfer, Preprint 97–118, SFB 343 “Diskrete Strukturen in der Mathematik”, Universität Bielefeld, 1997. General theory of information transfer: updated, General Theory of Information Transfer and Combinatorics, a Special Issue of Discrete Applied Mathematics 156(9), 1348–1388 (2008)MATHMathSciNet
8.
R. Ahlswede, M.V. Burnashev, On minimax estimation in the presence of side information about remote data. Ann. Statist. 18(1), 141–171 (1990)CrossRefMATHMathSciNet
9.
R. Ahlswede, N. Cai, Z. Zhang, Erasure, list, and detection zero-error capacities for low noise and a relation to identification. Preprint 93–068, SFB 343 Diskrete Strukturen in der Mathematik, Universität Bielefeld. IEEE Trans. Inform. Theor. 42(1), 55–62 (1996)
10.
R. Ahlswede, N. Cai, Z. Zhang, in Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers, General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol. 4123 (Springer, 2006), pp. 285–292
11.
R. Ahlswede, I. Csiszár, Hypothesis testing under communication constraints. IEEE Trans. Inform. Theor. IT-32(4), 533–543 (1986)
12.
13.
R. Ahlswede, J. Wolfowitz, The structure of capacity functions for compound channels. in Proceedings of the International Symposium on Probability and Information Theory, April 1968 (McMaster University, Canada, 1969), pp. 12–54
14.
15.
T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression (Prentice-Hall, Englewood Cliffs, 1971)
16.
17.
I. Csiszár, J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems (Academic, New York, 1981)MATH
18.
R.L. Dobrushin, General formulation of Shannon’s main theorem of information theory. Usp. Math. Nauk. 14, 3–104 (1959)MATH
19.
R.L. Dobrushin, General formulation of Shannon’s main theorem of information theory. Am. Math. Soc. Trans. 33, 323–438 (1962)
20.
S.M. Dodunekov, Optimization problems in coding theory. in Workshop on Combinatorial Search, Budapest, 23–26 April 2005
21.
J.L. Doob, Review of “A mathematical theory of communication”. Math. Rev. 10, 133 (1949)
22.
R.M. Fano, Transmission of Information, A Statistical Theory of Communication (Wiley, New York, 1961)
23.
A. Feinstein, Foundations of Information Theory (McGraw-Hill, New York, 1958)MATH
24.
R.G. Gallager, Information Theory and Reliable Communication (Wiley, New York, 1968)MATH
25.
R.M. Gray, D.S. Ornstein, Block coding for discrete stationary \(\overline{d}\)-continuous noisy channels. IEEE Trans. Inf. Theor. IT-25(3), 292–306 (1979)
26.
S. Györi, Coding for a multiple access OR channel: a survey. General Theory of Information Transfer and Combinatorics, Special Issue of, Discrete Applied Mathematics, 156(9), 2008
27.
W. Haemers, On some problems of Lovasz concerning the Shannon capacity of a graph. IEEE Trans. Inform. Theor. 25(2), 231–232 (1979)CrossRefMATHMathSciNet
28.
T.S. Han, Oral, communication in 1998
29.
T.S. Han, Information-Spectrum Methods in Information Theory, April 1998 (in Japanese).
30.
T.S. Han, S.I. Amari, Statistical inference under multiterminal data compression, information theory: 1948–1998. IEEE Trans. Inform. Theor. 44(6), 2300–2324 (1998)CrossRefMATHMathSciNet
31.
T.S. Han, S. Verdú, Approximation theory of output statistics. IEEE Trans. Inf. Theor. IT-39(3), 752–772 (1993)
32.
T.S. Han, S. Verdú, New results in the theory of identification via channels. IEEE Trans. Inform. Theor. 39(3), 752–772 (1993)CrossRefMATH
33.
E.A. Haroutunian, Upper estimate of transmission rate for memoryless channel with countable number of output signals under given error probability exponent, (in Russian). in 3rd All-Union Conference on Theory of Information Transmission and Coding (Publication house of Uzbek Academy of Sciences, Uzhgorod, Tashkent, 1967), pp. 83–86
34.
M.B. Hastings, Superadditivity of communication capacity using entangled inputs. Letters (2009)
35.
36.
M. Horodecki, Is the Classical Broadcast Channel Additive? Oral Communication (Cambridge England, 2004)
37.
K. Jacobs, Almost periodic channels. in Colloquium on Combinatorial Methods in Probability Theory, Matematisk Institute, Aarhus University, 1–10 Aug 1962, pp. 118–126
38.
F. Jelinek, Probabilistic Information Theory (McGraw-Hill, New York, 1968)MATH
39.
W. Kautz, R. Singleton, Nonrandom binary superimposed codes. IEEE Trans. Inform. Theor. 10, 363–377 (1964)CrossRefMATH
40.
J.C. Kieffer, A general formula for the capacity of stationary nonanticipatory channels. Inf. Contr. 26, 381–391 (1974)CrossRefMathSciNet
41.
J.C. Kieffer, Block coding for weakly continuous channels. IEEE Trans. Inf. Theor. IT-27(6), 721–727 (1981)
42.
J.C. Kieffer, Epsilon-capacity of a class of nonergodic channels. in Proceedings of IEEE International Symposium Information Theory (Seattle, WA, 2006), pp. 1268–1271.
43.
J.C. Kieffer, \(\varepsilon \)-capacity of binary symmetric averaged channels. IEEE Trans. Inf. Theor. 53(1), 288–303 (2007)CrossRefMathSciNet
44.
M.S. Pinsker, Information and Stability of Random Variables and Processes (Izd-vo Akademii Nauk, Moscow, 1960)
45.
B. Schumacher, M.D. Westmoreland, Sending classical information via noisy quantum channels. Phys. Rev. A 56(1), 131–138 (1997)CrossRef
46.
47.
48.
S. Verdú, T.S. Han, A general formula for channel capacity. IEEE Trans. Inform. Theor. 40(4), 1147–1157 (1994)CrossRefMATH
49.
J. Wolfowitz, Coding theorems of information theory. in Ergebnisse der Mathematik und ihrer Grenzgebiete, vol. 31, 3rd edn., (Springer (Englewood Cliffs, Berlin-Göttingen-Heidelberg, Prentice-Hall, 1978), p. 1961
50.
51.
R.W. Yeung, A First Course in Information Theory, Information Technology: Transmission, Processing and Storage (Kluwer Academic/Plenum Publishers, New York, 2002)CrossRef
52.
J. Ziv, Back from Infinity: a constrained resources approach to information theory. IEEE Inform. Theor. Soc. Newslett. 48(1), 30–33 (1998)
Metadaten
Titel
Towards Capacity Functions
verfasst von
Rudolf Ahlswede
Alexander Ahlswede
Ingo Althöfer
Christian Deppe
Ulrich Tamm
Copyright-Jahr
2014
Buch
Storing and Transmitting Data

Print ISBN: 978-3-319-05478-0

Electronic ISBN: 978-3-319-05479-7

Copyright-Jahr: 2014

DOI
https://doi.org/10.1007/978-3-319-05479-7_6