FAKULTÄT FÜR MATHEMATIK

Weitere Literaturhinweise im Ergebnisbericht

1

R. Ahlswede, Multi-way communication channels, Proceedings of 2nd International Symposium on Information Theory, Thakadsor, Armenian SSR, Sept. 1971, Akademiai Kiado, Budapest, 23-52, 1973.

2

R. Ahlswede, Elimination of correlation in random codes for arbitrarily varying channels, Z. Wahrscheinlichkeitstheorie und verw. Geb. 44, 159-175, 1978.

3

R. Ahlswede, A method of coding and its application to arbitrarily varying channels, J. Combinatorics, Information and System Sciences, Vol. 5, No. 1, 10-35, 1980.

4

R. Ahlswede, An elementary proof of the strong converse theorem for the multiple-access channel, J. Combinatorics, Information and System Sciences, Vol. 7, No. 3, 216-230, 1982.

5

R. Ahlswede, H. Aydinian, and L.H. Khachatrian, Extremal problems under dimension constraints, Discrete Mathematics, Special issue: EuroComb'01 - J. Nesetril, M. Noy and O. Serra (Ed), Vol. 273, No. 1-3, 9-21, 2003.

6

R. Ahlswede and G. Dueck, Bad codes are good ciphers, Probl. of Control and Inf. Theory, Vol. 11, No. 5, 337-351, 1982.

7

R. Ahlswede, P. Gács, and J. Körner, Bounds on conditional probabilities with applications in multiuser communication, Z. Wahrscheinlichkeitstheorie und verw. Geb. 34, 157-177, 1976.

8

R. Ahlswede and I. Wegener, Search Problems with Supplement of recent Literature, Wiley-Interscience Series in Discrete Mathematics and Optimization, 1987.

9

R. Ahlswede and Z. Zhang, New directions in the theory of identification via channels, IEEE Trans. Inf. Theory, Vol. 41, No. 4, 1040-1050, 1995.

10

V.E. Benes, Optimal rearrangeable multistage connecting networks, Bell System Tech. J. 43, 1641-1656, 1964.

11

E.R. Berlekamp, Block coding with noiseless feedback, Phd-thesis, MIT, Cambridge, MA, 1964.

12

L. Brankovic, P. Horak, and M. Miller, An optimization problem in statistical databases, SIAM J. Discrete Math., Vol. 13, 346-353, 2000.

13

F.Y. Chin and G. Ozsoyoglu, Auditing and inference control in statistical databases, IEEE Transactions on Software Engineering SE-8, 574-582, 1982.

14

C. Clos, A study of non-blocking switching networks, Bell System Tech. J. 32, 406-424, 1953.

15

I. Csiszár and Körner, Broadcast channel with confidential message, IEEE Trans. Inform. Theory, Vol. 24, 339-348. 1978.

16

I. Csiszár and P. Narayan, The capacity of the arbitrarily varying channel revisited: positivity constraints, IEEE Transactions of IT, Vol. 34, No, 2, 181-193, 1988.

17

J. Demetrovich, G.O.H. Katona, and D. Miklos, On the security of individual data, Lecture Notes in Comp. Sci., Vol. 2942, 49-58, Springer 2004.

18

T. Ericson, Exponential error bounds for random codes in the arbitrarily varying channel, IEEE Transactions on IT, Vol. 31, No. 1, 42-48, 1985.

19

P.C. Fishburn and L. Shepp, The Ahlswede-Daykin theorem, Numbers, Information, and Complexity, Kluwer, 501-516, 2000.

20

J. R. Griggs, Database security and the distribution of subset sums in , Graph theory and combinatorial biology (Balatonlelle, 1996), 223-252, Janos Bolyai Math. Soc., 1999.

21

J. Havrda and F. Charvát, Quantification method of classification processes, concept of structural -entropy, Kybernetika (Prague) 3, 30-35, 1967.

22

H.D.L. Hollmann, J.H. van Lint, J.P. Lennartz, and L.M.G.M. Tolhuizen, On codes with the identifiable parent property, J. Combin. Theory Ser. A, Vol. 82, No. 2, 121-133, 1998.

23

M.A. Nowak and D.C. Krakauer, The evolution of language, PNAS 96, 14, 8028-8033, 1999.

24

C.E. Shannon, Memory requirements in a telephone exchange, Bell System Tech. J. 29, 343-349, 1950.

25

D. Slepian, Two theorems on a particular crossbar switching network, unpublished manuscript, 1952.

26

T. Tao, Szemeredi's regularity lemma revisited, Contrib. Discrete Math. 1, 8-28, 2006.

27

A. Winter, The capacity region of the quantum multiple access channel, IEEE Trans. Inform. Theory, Vol. 47, No. 7, 3059-3065, 2001.

28

A.D. Wyner, The wire-tap channel, Bell Sys. Tech. J. V. 54, 1355-1387, 1975.

29

Z. Zhang, A simplified method for computing the key equivocation for additive-like instantaneous block encipherers, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 276-284, 2006.

• Qualifikation des wissenschaftlichen Nachwuchses im Zusammenhang mit dem Projekt
• Projektmitarbeiter