|
Interaktive Kommunikation, Diagnose und Vorhersage in Netzwerken
-
- 1
- R. Ahlswede and L.H. Khachatrian,
The diametric theorem in Hamming spaces - optimal anticodes,
Advances in Applied Mathematics 20, 429-449, 1998.
- 2
- R. Ahlswede,
``A constructive proof of the coding theorem for discrete memoryless channels with feedback'',
Transactions of the Sixth Prague Conference on Information Theory,
Statistical Decision Functions, Random Processes (Tech. Univ.,
Prague), 39-50, 1971.
- 3
- R. Ahlswede,
Remarks on Shannon's secrecy systems, Probl. of Control and Inf. Theory, Vol. 11, No. 4, 301-318, 1982.
- 4
- R. Ahlswede and G. Dueck,
Bad Codes are good ciphers, Probl. of Control and Inf. Theory, Vol. 11, No. 5, 337-351, 1982.
- 5
- R. Ahlswede, N. Cai, S.Y.R. Li, and R.W. Yeung,
Network information flow, IEEE Trans. Inf. Theory, Vol. 46, No. 4, 1204-1216, 2000.
- 6
- R. Ahlswede, L. Bäumer, N. Cai, H. Aydinian, V. Blinovsky, C. Deppe, and H. Mashurian (Editors),
General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science,
Springer Verlag, Vol. 4123, 2006.
- 7
- R. Ahlswede and I. Wegener,
Search Problems, with Supplement of recent Literature, R.L. Graham, J.K. Leenstra, R.E. Tarjan (Ed.),
Wiley-Interscience Series in Discrete Mathematics and Optimization, 1987.
- 8
- L. A. Bassalygo, V. A. Zinov'ev,
V. V. Zyablov, M. S. Pinsker, G. Sh. Poltyrev, ``Bounds for codes with unequal protection of two sets of
messages'', Problems Inform. Transmission 15, no. 3, 190-197, (1980);
translated from Problemy Peredachi Informatsii 15,
no. 3,40-49, 1979 (Russian)
- 9
- A. Baltz, G. Jäger, and A. Srivastav,
Constructions of sparse asymmetric connectors with number theroretic methods.
Networks 45, 3, 119-124, 2005.
- 10
- V.E. Benes,
``Mathematical theory of connecting networks and telephone
traffic'',
New York Acad. Pr., 1965.
- 11
- V. Blinovsky, R. Dobrushin,
``Process Level Large Deviations for a Class
of Piecewise Homogenous Random Walks'', in the book: Dynkin Festschrift, Markov
Processes and their Applications, Birkhauser, 1-60, 1994.
- 12
- C. Clos,
``A study of non-blocking switching networks'',
Bell System Tech. J. 32, 406-424, 1953.
- 13
- H.D.L. Hollmann, J.H. van Lint, J.-P. Linnartz,
L.M.G.M. Tolhuizen,
``On Codes with the Identifiable Parent Property'',
J. Combin. Theory, Ser. A, V32, 121-133, 1996.
- 14
- F.K. Hwang, G.W. Richards,
''A two-stage network with dual partial concentrators'',
Networks, 23, 53-58, 1992.
- 15
- M. G. Karpovsky, K. Chakrabarty, L.B. Levitin, D. R. Avresky,
''On the covering of vertices for fault diagnosis in hypercubes'',
Information Processing Letters, 69, 99-103, 1999.
- 16
- A.Y. Oruc, H.M. Huang,
''Crosspoint complexity of sparse crossbar concentrators'',
IEEE Trans. on Inf. Theory, 42, 5, 1466-1471, 1996.
- 17
- A.Y. Oruc,
``A study of permutation networks: some generalizations and
tradeoffs'',
J. of Paral. and Distr. Comput., 359-366, 1994.
- 18
- N. Pippenger,
''Fault-tolerant Circuit-switching networks'',
SIAM J. Disc. Math., Vol. 7, No. 1, 108-118, 1994.
- 19
- N. Pippenger, A.C. Yao,
``On rearangeable networks with limited depth'',
SIAM J. Algebraic Discrete Methods, 3, 411-417, 1982.
- 20
- N. Pippenger,
``On rearangeable and nonblocking switching networks'',
J. Comput. System Sci., 17, 145-162, 1987.
- 21
- C.E. Shannon,
``Memory Requirements in a Telephone Exchange'',
Bell System Tech. J., 343-349, 1950.
- 22
-
D. Slepian, ``Two Theorems on a Particular Crossbar Switching Network'',
unpublished manuscript, 1952.
- 23
- R.W. Yeung, A First Course in Information Theory, Kluwer Academic Publishers, 2002.
Unterabschnitte
|
