WWW   

    FAKULTÄT FÜR MATHEMATIK
Allgemeine Theorie des Informationstransfer und Kombinatorik


Liste der Publikationen aus diesem Projekt

Erstantrag


A. Allgemeine Theorie des Informationstransfers / General theory of information transfer

    P1
    R. Ahlswede, General theory of information transfer:updated, General Theory of Information Transfer and Combinatorics, Special Issue of Discrete Applied Mathematics, to appear.

A.1 Klassische Kanäle und Quellen / Classical channels and sources

    P2
    R. Ahlswede, Identification entropy, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 595-613, 2006.

    P3
    R. Ahlswede and N. Cai, An interpretation of identification entropy, IEEE Trans. Inf. Theory, Vol. 52, No. 9, 4198-4207, 2006.

    P4
    R. Ahlswede and N. Cai, Watermarking identification codes with related topics in common randomness, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 107-153, 2006.

    P5
    R. Ahlswede, N. Cai, and Z. Zhang, 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 Verlag, 285-292, 2006.

    P6
    R. Ahlswede and N. Cai, Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 258-275, 2006.

    P7
    R. Ahlswede and N. Cai, Codes with the identifiable parent property and the multiple-access channel, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 249-257, 2006.

    P8
    Christian Heup, L-identification for sources, Doktorarbeit, Universität Bielefeld, 2006.

    P9
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian Unidirectional error control codes and related combinatorial problems, in Proceedings of Eighths International Workshop on Algebraic and Combinatorial Coding Theory, 8-14 September, Tsarskoe Selo, Russia, 6-9, 2002.

    P10
    R. Ahlswede, H. Aydinian, L.H. Khachatrian, and L.M. Tolhuizen, On q-ary codes correcting all unidirectional errors of a limited magnitude, to appear in the special issue dedicated to the memory of Varshamov, Abstract included in Proceedings of the International workshop on Algebraic and Combinatorial Coding Theory (ACCT), held in Kranevo, Bulgaria, June 19 - 25, 2004.

    P11
    R. Ahlswede, B. Balkenhol, C. Deppe, H. Mashurian, and T. Partner, $ T$ -Shift synchronization codes, General Theory of Information Transfer and Combinatorics, Special Issue of Discrete Applied Mathematics, to appear.

A.2 Vorhersagetheorie / Prediction theory



    P12
    L. Bäumer, Identification and prediction, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 2006.




A.3 Quantentheoretische Kanäle und Quellen / Quantum theoretical channels and sources

    P13
    R. Freivalds and A. Winter, Quantum finite state transducers, Proc. SOFSEM 2001, Theory and Practice of Informatics, Springer, 233-242, 2001.

    P14
    H. Barnum, P. Hayden, R. Jozsa, and A. Winter, On the reversible extraction of classical information from a quantum source, Roy. Soc. Lond. Proc. A Math. Phys. Eng. Sci., vol. 457, no. 2012, 2019-2039, 2001.

    P15
    A. Winter, On the fidelity of two pure states, J. Phys. A, vol. 34, no. 35, 7095-7101, 2001.

    P16
    P. Hayden, R. Jozsa, and A. Winter, Trading quantum for classical resourses in quantum data compression, e-print: quant-ph/0204038, 2002.

    P17
    R. Ahlswede and N. Cai, On lossless quantum data compression and quantum variable-length codes, Chapter 6 in ``Quantum Information Processing'', Gerd Leuchs, Thomas Beth (Eds.), Wiley-VCH Verlag, Weinheim, Germany, 66-78, 2003.

    P18
    R. Ahlswede and N. Cai, On lossless quantum data compression with a classical helper, IEEE Trans. Inf. Theory, Vol. 50, No. 6, 2004.

    P19
    R. Ahlswede and V. Blinovsky, Large deviations in quantum information theory, Probl. of Inf. Transm., Vol. 39, No. 4, 373-379, 2003.

    P20
    R. Ahlswede and N. Cai, A strong converse theorem for quantum multiple access channels, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 460-485, 2006.

    P21
    R. Ahlswede and V. Blinovsky, Classical capacity of classical-quantum arbitrarily varying channels, IEEE Trans. Inf. Theory, Vol. 53, No. 2, 526-533, 2007.

A.4 Quantenkryptologie / Quantum cryptology

    P22
    N. Cai, A. Winter, and R. W. Yeung, Quantum privacy and quantum wiretap channel, Probl. Inf. Transm., Vol. 40, No. 4, 318-336, 2004.

    P23
    R. Wilmink, Quantum Broadcast Channels and New Directions in Quantum Cryptography, Dissertation, Bielefeld, 2002.
    download at: www.mathematik.uni-bielefeld.de/rwilmink/

B. Kombinatorik

    P24
    R. Ahlswede, Advances on extremal problems in number theory and combinatorics, European Congress of Mathematics, Barcelona 2000, Vol. I, 147-175, Carles Casacuberta, Rosa Maria Miró-Roig, Joan Verdera, Sebastiá Xambó-Descamps, edit., Progress in Mathematics, Vol. 201, Birkhäuser Verlag, Basel-Boston-Berlin, 2001.

B.1 Entwicklung von Methoden: Ungleichungen und Extremalprobleme / Development of methods: inequalities and extremal problems

    P25
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian, On shadows of intersecting families, Combinatorica 24 (4), 555-566, 2004.

    P26
    R. Ahlswede and L.H. Khachatrian, Katona's intersection theorem: four proofs, Combinatorica 25 (1), 105-110, 2005.

    P27
    R. Ahlswede and H. Aydinian, Sparse asymmetric connectors in communication networks, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 1056-1062, 2006.

    P28
    R. Ahlswede and H. Aydinian, Construction of asymmetric connectors of depth two, submitted to a special issue of J. Combinatorial Theory, Series A, in memory of Jacobus H. van Lint, Vol. 113, No. 8, 1614-1620, 2006.

    P29
    R. Ahlswede and V. Blinovsky, On switching for hypergraphs, submitted to European J. of Combinatorics.

    P30
    R. Ahlswede and V. Blinovsky, About the number of step functions with restrictions, Probability Theory and Applications, Vol. 50, No. 4, 537-560, 2006.

    P31
    R. Ahlswede and V. Blinovsky, Multiple packing in sum-type metric spaces, General Theory of Information Transfer and Combinatorics, Special Issue of Discrete Applied Mathematics, to appear.

    P32
    R. Ahlswede and V. Blinovsky, Correlation inequalities in function spaces, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 572-577, 2006.

    P33
    R. Ahlswede, Another diametric theorem in Hamming spaces: optimal group anticodes, Proceedings of the IEEE Information Theory Workshop, March 13-17 in Punta del Este, 2006.

B.2 Extremalprobleme unter Dimensionsbeschränkungen/ Extremal problems under dimensions constraints

    P34
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian, Maximal antichains under dimension constraints, Discrete Mathematics, Special issue: EuroComb'01 - Edited by J. Nesetril, M. Noy and O. Serra, Vol. 273, No. 1-3, 23-29, 2003.

    P35
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian, Forbidden (0,1)-vectors in hyperplanes of $ \mathbb{R}^n$ : the restricted case, Designs, Codes and Cryptography, 29, 17-28, 2003.

    P36
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian, Forbidden (0,1)-vectors in hyperplanes of $ \mathbb{R}^n$ : the unrestricted case, Designs, Codes and Cryptography 37, 151-167, 2005.

    P37
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian, On Bohman's conjecture related to a sum packing problem of Erdös, Proceedings of the American Mathematical Society, Vol. 132, No. 5, 1257-1265, 2004.

    P38
    R. Ahlswede, H. Aydinian, and L.H. Khachatrian, Intersection theorems under dimension constrains, J. Combin. Theory Ser. A, 113, 483-519, 2006.

B.3 Kombinatorische Zahlentheorie / Combinatorial Number Theory

    P39
    R. Ahlswede, L.H. Khachatrian, C. Mauduit, and A. Sárközy, A complexity measure for families of binary sequences Periodica Mathematica Hungarica, Vol. 46 (2), 107-118, 2003.

    P40
    R. Ahlswede, C. Mauduit, and A. Sárközy, Large families of pseudorandom sequences of $ k$ symbols and their complexity, Part I, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 293-307, 2006.

    P41
    R. Ahlswede, C. Mauduit, and A. Sárközy, Large families of pseudorandom sequences of $ k$ symbols and their complexity, Part II, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 308-325, 2006.

    P42
    R. Ahlswede, J. Cassaigne, and A. Sárközy, On the correlation of binary sequences, General Theory of Information Transfer and Combinatorics, Special Issue of Discrete Applied Mathematics, to appear.

    P43
    R. Ahlswede and V. Blinovsky, Maximal sets of integers not containing $ k+1$ pairwise coprimes and having divisors from a specified set of primes, Special Issue in Honor of Jacobus H. van Lint of J. Combinatorial Theory, Series A, Vol. 113, No. 8, 1621-1628, 2006.

    P44
    R. Ahlswede and V. Blinovsky, Maximal sets of ideals without coprimes, submitted to J. Number Theory.

    P45
    R. Ahlswede, The final form of Tao's inequality relating conditional expectation and conditional mutual information, Advances in Mathematics of Communications, Vol. 1, No. 2, 239-242, 2007.

B.4 Sortieren und Suchen / Search and sorting

    P46
    R. Ahlswede and N. Cai, A Kraft-type inequality for $ d$ -delay binary search codes, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 704-706, 2006.

    P47
    R. Ahlswede and N. Cai, Search with noisy and delayed responses, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 695-703, 2006.

    P48
    R. Ahlswede, B. Balkenhol, C. Deppe, and M. Fröhlich, A fast suffix-sorting algorithm, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 719-734, 2006.

    P49
    R. Ahlswede, Rate-wise optimal non-sequential search strategies under a cardinality constraint on the tests, General Theory of Information Transfer and Combinatorics, Special Issue of Discrete Applied Mathematics, to appear.

    P50
    F. Cicalese and C. Deppe, Perfect ,minimally adaptive q-ary search with unreliable tests, Journal of Statistical Planning and Inference, Vol. 137, No. 1, 162-175, 2006.

    P51
    F. Cicalese and C. Deppe, Quasi-perfect minimally adaptive q-ary search with unreliable tests, Algorithms and Computation, Lecture Notes in Computer Science, Vol. 2906, Springer Verlag, 527 - 536, 2003.

    P52
    F. Cicalese and C. Deppe, q-ary Ulam-Renyi game with constrained lies, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 678-694, 2006.

    P53
    F. Cicalese, C. Deppe, and D. Mundici, q-ary Ulam-Renyi game with weighted constrained lies, Proceedings of 10th Annual International Conference on Computing and Combinatorics- COCOON'2004, Lecture Notes in Computer Science, Vol. 3106, 82-91, 2004.

    P54
    R. Ahlswede, F. Cicalese, and C. Deppe, Searching with lies under error transition cost constraints, General Theory of Information Transfer and Combinatorics, Special Issue of Discrete Applied Mathematics, to appear.

    P55
    C. Deppe, Strategies for the fixed Renyi-Ulam Game with fixed number of lies, Theoretical Computer Science 314, 45-55, 2004.

    P56
    C. Deppe, A survey of new results in coding with feedback and searching with lies, Information and Communication Security, Series D, IOS Press, to appear.

    P57
    C. Deppe and H. Schnettler, On the $ 3\over 4$ - conjecture for fix-free codes, Discrete Mathematics and Theoretical Computer Science, Seminar Proceedings, Volume AE, 111-116, 2005.

    P58
    R. Ahlswede, C. Deppe, and V. Lebedev Nonbinary error correcting codes with noiseless feedback, localized errors or both, Annals of European Academy of Science, No. 1, 285 - 309, 2005.

C. New Directions

C.1 Statistics and Identification

    P59
    R. Ahlswede and E. Haroutunian, On logarithmically asymptotically optimal testing of hypothesis and identification, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 553-571, 2006.

    P60
    R. Ahlswede, E. Haroutunian, and E. Aloyan, On logarithmically asymptotically optimal hypothesis testing for arbitrarily varying source with side information, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 547-552, 2006.

C.2 Information and Evolution

    P61
    R. Ahlswede, E. Arikan, L. Bäumer, and C. Deppe, Information theoretic models in language evolution, General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 769-787, 2006. Accepted as extended abstract Language Evolution and Information Theory in ISIT, Chicago June 27-July 2, 2004.

C.3 Network Coding

    P62
    R. Ahlswede and S. Riis, Problems in Network coding and error correcting codes, NETCOD 2005 (The First Workshop on Network Coding Theory and Applications), Trento Italy, April 7, 2005, see also General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, Vol. 4123, Springer Verlag, 861-897, 2006.

Fortsetzungsantrag

B.1 Entwicklung von Methoden: Ungleichungen und Extremalprobleme / Development of methods: inequalities and extremal problems

    P63
    R. Ahlswede and F. Soloveva, Further diametric theorems in Lee- and other spaces, in preparation.

B.4 Sortieren und Suchen / Search and sorting

    P64
    R. Ahlswede, F. Cicalese, C. Deppe, and U. Vaccaro, Two batch search with weighted lies, IEEE Trans. Inf. Theory, submitted.

C.4 Security in Database

    P65
    R. Ahlswede and H. Aydinian, On security of statistical databases, SIAM Journal on Discrete Mathematics, submitted.


Ahlswede Symposium 2007-08-17