Bibliography of Publications

by

Rudolf Ahlswede

truecm

1967

[1]

Certain results in coding theory for compound channels, Proc. Colloquium Inf. Th. Debrecen (Hungary), 35-60.

1968

[2]

Beiträge zur Shannonschen Informationstheorie im Fall nichtstationärer Kanäle, Z. Wahrscheinlichkeitstheorie und verw. Geb. 10, 1-42.

[3]

The weak capacity of averaged channels, Z. Wahrscheinlichkeitstheorie und verw. Geb. 11, 61-73.

1969

[4]

Correlated decoding for channels with arbitrarily varying channel probability functions, (with J. Wolfowitz), Information and Control 14, 457-473.

[5]

The structure of capacity functions for compound channels, (with J. Wolfowitz), Proc. of the Internat. Symposium on Probability and Information Theory at McMaster University, Canada, April 1968, 12-54.

1970

[6]

The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet, (with J. Wolfowitz), Z. Wahrscheinlichkeitstheorie und verw. Geb. 15, 186-194.

[7]

A note on the existence of the weak capacity for channels with arbitrarily varying channel probability functions and its relation to Shannon's zero error capacity, Ann. Math. Stat., Vol. 41, No. 3, 1027-1033.

1971

[8]

Channels without synchronization, (with J. Wolfowitz), Advances in Applied Probability, Vol. 3, 383-403.

[9]

Group codes do not achieve Shannon's channel capacity for general discrete channels, Ann. Math. Stat., Vol. 42, No. 1, 224-240.

[10]

Bounds on algebraic code capacities for noisy channels I, (with J. Gemma), Information and Control, Vol. 19, No. 2, 124-145.

[11]

Bounds on algebraic code capacities for noisy channels II, (with J. Gemma), Information and Control, Vol. 19, No. 2, 146-158.

1973

[12]

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

[13]

On two-way communication channels and a problem by Zarankiewicz, Sixth Prague Conf. on Inf. Th., Stat. Dec. Fct's and Rand. Proc., Sept. 1971, Publ. House Chechosl. Academy of Sc., 23-37.

[14]

A constructive proof of the coding theorem for discrete memoryless channels in case of complete feedback, Sixth Prague Conf. on Inf. Th., Stat. Dec. Fct's and Rand. Proc., Sept. 1971, Publ. House Czechosl. Academy of Sc., 1-22.

[15]

The capacity of a channel with arbitrarily varying additive Gaussian channel probability functions, Sixth Prague Conf. on Inf. Th., Stat. Dec. Fct's and Rand. Proc., Sept. 1971, Publ. House Czechosl. Academy of Sc., 39-50.

[16]

Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback, Z. Wahrscheinlichkeitstheorie und verw. Geb. 25, 239-252.

[17]

Channel capacities for list codes, J. Appl. Probability, lo, 824-836.

1974

[18]

The capacity region of a channel with two senders and two receivers, Ann. Probability, Vol. 2, No. 5, 805-814.

[19]

On common information and related characteristics of correlated information sources, (with J. Körner), presented at the 7th Prague Conf. on Inf. Th., Stat. Dec. Fct's and Rand. Proc., included in ``Information Theory'' by I. Csiszár and J. Körner, Acad. Press, 1981. Recently included in General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

1975

[20]

Approximation of continuous functions in p-adic analysis, (with R. Bojanic), J. Approximation Theory, Vol. 15, No. 3, 190-205.

[21]

Source coding with side information and a converse for degraded broadcast channels, (with J. Körner), IEEE Trans. Inf. Theory, Vol. IT-21, 629-637.

[22]

Two contributions to information theory, (with P. Gács), Colloquia Mathematica Societatis János Bolyai, 16. Topics in Information Theory, I. Csiszár and P. Elias Edit., Keszthely, Hungaria, 1975, 17-40.

1976

[23]

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

[24]

Every bad code has a good subcode: a local converse to the coding theorem, (with G. Dueck), Z. Wahrscheinlichkeitstheorie und verw. Geb. 34, 179-182.

[25]

Spreading of sets in product spaces and hypercontraction of the Markov operator, (with P. Gács), Ann. Prob., Vol. 4, No. 6, 925-939.

1977

[26]

On the connection between the entropies of input and output distributions of discrete memoryless channels, (with J. Körner), Proceedings of the 5th Conference on Probability Theory, Brasov 1974, Editura Academeiei Rep. Soc. Romania, Bucaresti 1977, 13-23.

[27]

Contributions to the geometry of Hamming spaces, (with G. Katona), Discrete Mathematics 17, 1-22.

[28]

The number of values of combinatorial functions, (with D.E. Daykin), Bull. London Math. Soc., 11, 49-51.

1978

[29]

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

[30]

An inequality for the weights of two families of sets, their unions and intersections, (with D.E. Daykin), Z. Wahrscheinlichkeitstheorie und verw. Geb. 43, 183-185.

[31]

Graphs with maximal number of adjacent pairs of edges, (with G. Katona), Acta Math. Acad. Sc. Hung. 32, 97-120.

1979

[32]

Suchprobleme, (with I. Wegener), Teubner Verlag, Stuttgart, Russian Edition with Appendix by Maljutov 1981 (Book).

[33]

Inequalities for a pair of maps $S\times S\rightarrow S$ with $S$ a finite set, (with D.E. Daykin), Math. Zeitschrift 165, 267-289.

[34]

Integral inequalities for increasing functions, (with D.E. Daykin), Math. Proc. Comb. Phil. Soc., 86, 391-394.

[35]

Coloring hypergraphs: A new approach to multi-user source coding I, Journ. of Combinatorics, Information and System Sciences, Vol. 4, No. 1, 76-115.

1980

[36]

Coloring hypergraphs: A new approach to multi-user source coding II, Journ. of Combinatorics, Information and System Sciences, Vol. 5, No. 3, 220-268.

[37]

Simple hypergraphs with maximal number of adjacent pairs of edges, J. Comb. Theory, Ser. B, Vol. 28, No. 2, 164-167.

[38]

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

1981

[39]

To get a bit of information may be as hard as to get full information, (with I. Csiszár), IEEE Trans. Inf. Theory, IT-27, 398-408.

[40]

Solution of Burnashev's problem and a sharpening of Erdos-Ko-Rado, Siam Review, to appear in a book by G. Katona. Recently included in General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

1982

[41]

Remarks on Shannon's secrecy systems, Probl. of Control and Inf. Theory, Vol. 11, No. 4, 301-318.

[42]

Bad Codes are good ciphers, (with G. Dueck), Probl. of Control and Inf. Theory, Vol. 11, No. 5, 337-351.

[43]

Good codes can be produced by a few permutations, (with G. Dueck), IEEE Trans. Inf. Theory, IT-28, No. 3, 430-443.

[44]

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.

[45]

Jacob Wolfowitz (1910-1981), IEEE Trans. Inf. Theory, Vol. IT-28, No. 5, 687-690.

1983

[46]

Note on an extremal problem arising for unreliable networks in parallel computing, (with K.U. Koschnick), Discrete Mathematics 47, 137-152.

[47]

On source coding with side information via a multiple-access channel and related problems in multi-user information theory, (with T.S. Han), IEEE Trans. Inf. Theory, Vol. IT-29, No. 3, 396-412.

1984

[48]

A two family extremal problem in Hamming space, (with A. El Gamal and K.F. Pang), Discrete mathematics 49, 1-5.

[49]

Improvements of Winograd's Result on Computation in the Presence of Noise, IEEE Trans. Inf. Theory, Vol. IT-30, No. 6, 872-877.

1985

[50]

The rate-distortion region for multiple descriptions without excess rate, IEEE Trans. Inf. Theory, Vol. IT-31, No. 6, 721-726.

1986

[51]

Hypothesis testing under communication constraints, (with I. Csiszár), IEEE Trans. Inf. Theory, Vol. IT-32, No. 4, 533-543.

[52]

On multiple description and team guessing, IEEE Trans. Inf. Theory, Vol. IT-32, No. 4, 543-549.

[53]

Arbitrarily varying channels with states sequence known to the sender, invited paper at a Statistical Research Conference dedicated to the memory of Jack Kiefer and Jacob Wolfowitz, held at Cornell University, July 1983, IEEE Trans. Inf. Theory, Vol. IT-32, No. 5, 621-629.

1987

[54]

Optimal coding strategies for certain permuting channels, (with A. Kaspi), IEEE Trans. Inf. Theory, Vol. IT-33, No. 3, 310-314.

[55]

Search Problems, (with I. Wegener), English Edition of [32] with Supplement of recent Literature, Wiley-Interscience Series in Discrete Mathematics and Optimization, R.L. Graham, J.K. Leenstra, R.E. Tarjan, edit.

[56]

Inequalities for code pairs, (with M. Moers), European J. of Combinatorics 9, 175-181.

[57]

Eight problems in information theory
-- a complexity problem
-- codes as orbits
Contributions to ``Open Problems in Communication and Computation'', T.M. Cover and B. Gopinath, Editors, Springer-Verlag.

[58]

On code pairs with specified Hamming distances, Colloquia Mathematica Societatis János Bolyai 52, Combinatorics, Eger (Hungary), 9-47.

1989

[59]

Identification via channels, (with G. Dueck), IEEE Trans. Inf. Theory, Vol. 35, No. 1, 15-29.

[60]

Identification in the presence of feedback -- a discovery of new capacity formulas, (with G. Dueck), IEEE Trans. Inf. Theory, Vol. 35, No. 1, 30-39.

[61]

Contributions to a theory of ordering for sequence spaces, (with Z. Zhang), Problems of Control and Information Theory, Vol. 18, No. 4, 197-221.

1990

[62]

A general 4-words inequality with consequences for 2-way communication complexity, (with N. Cai and Z. Zhang), Advances in Applied Mathematics, Vol. 10, 75-94.

[63]

Coding for write-efficient memory, (with Z. Zhang), Information and Computation, Vol. 83, No. 1, 80-97.

[64]

Creating order in sequence spaces with simple machines, (with Jian-ping Ye and Z. Zhang), Information and Computation, Vol. 89, No. 1, 47-94.

[65]

An identity in combinatorial extremal theory, (with Z. Zhang), Adv. in Math., Vol. 80, No. 2, 137-151.

[66]

On minimax estimation in the presence of side information about remote data, (with M.V. Burnashev), Ann. of Stat., Vol. 18, No. 1, 141-171.

[67]

Extremal properties of rate-distortion functions, IEEE Trans. Inf. Theory, Vol. 36, No. 1, 166-171.

[68]

A recursive bound for the number of complete K-subgraphs of a graph, (with N. Cai and Z. Zhang), ``Topics in graph theory and combinatorics'' in honour of G. Ringel on the occasion of his 70th birthday, R. Bodendiek, R. Henn (Eds), 37-39.

[69]

On cloud-antichains and related configurations, (with Z. Zhang), Discrete Mathematics 85, 225-245.

1991

[70]

Reusable memories in the light of the old AV- and new OV-channel theory, (with G. Simonyi), IEEE Trans. Inf. Theory, Vol. 37, No. 4, 1143-1150.

[71]

On identification via multi-way channels with feedback, (with B. Verboven), IEEE Trans. Inf. Theory, Vol. 37, No. 5, 1519-1526.

[72]

Two proofs of Pinsker's conjecture concerning AV channels, (with N. Cai), IEEE Trans. Inf. Theory, Vol. 37, No. 6, 1647-1649.

1992

[73]

Diametric theorems in sequence spaces, (with N. Cai and Z. Zhang), Combinatorica, Vol. 12, No. 1, 1-17.

[74]

On set coverings in Cartesian product spaces, Ergänzungsreihe des SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Nr. 92-005. Recently included in General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[75]

Rich colorings with local constraints, (with N. Cai and Z. Zhang), Preprint 89-011, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, J. Combinatorics, Information & System Sciences, Vol. 17, Nos. 3-4, 203-216.

1993

[76]

Asymptotically dense nonbinary codes correcting a constant number of localized errors, (with L.A. Bassalygo and M.S. Pinsker), Proc. III International workshop ``Algebraic and Combinatorial Coding Theory'', June 22-28, 1992, Tyrnovo, Bulgaria, Comptes rendus de l' Académie bulgare des Sciences, Tome 46, No. 1, 35-37.

[77]

The maximal error capacity of AV channels for constant list sizes, IEEE Trans. Inf. Theory, Vol. 39, No. 4, 1416-1417.

[78]

Nonbinary codes correcting localized errors, (with L.A. Bassalygo and M.S. Pinsker), IEEE Trans. Inf. Theory, Vol. 39, No. 4, 1413-1416.

[79]

Common randomness in information theory and cryptography, Part I: Secret sharing, (with I. Csiszár), IEEE Trans. Inf. Theory, Vol. 39, No. 4, 1121-1132.

[80]

A generalization of the AZ identity, (with N. Cai), Combinatorica 13 (3), 241-247.

[81]

On partitioning the n-cube into sets with mutual distance 1, (with S.L. Bezrukov, A. Blokhuis, K. Metsch, and G.E. Moorhouse), Applied Math. Lett., Vol. 6, No. 4, 17-19.

[82]

Communication complexity in lattices, (with N. Cai and U. Tamm), Applied Math. Lett., Vol. 6, No. 6, 53-58.

[83]

Rank formulas for certain products of matrices, (with N. Cai), Preprint 92-014, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Applicable Algebra in Engineering, Communication and Computing, 2, 1-9.

[84]

On extremal set partitions in Cartesian product spaces, (with N. Cai), Preprint 92-034, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Combinatorics, Probability & Computing 2, 211-220.

1994

[85]

Note on the optimal structure of recovering set pairs in lattices: the sandglass conjecture, (with G. Simonyi), Preprint 91-082, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Discrete Math., 128, 389-394.

[86]

On extremal sets without coprimes, (with L.H. Khachatrian), Preprint 93-026, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Acta Arithmetica, LXVI 1, 89-99.

[87]

The maximal length of cloud-antichains, (with L.H. Khachatrian), Preprint 91-116, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Discrete Mathematics, Vol. 131, 9-15.

[88]

The asymptotic behaviour of diameters in the average, (with I. Althöfer), Preprint 91-099, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, J. Combinatorial Theory, Series B, Vol. 61, No. 2, 167-177.

[89]

2-way communication complexity of sum-type functions for one processor to be informed, (with N. Cai), Preprint 91-053, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Problemy Peredachi Informatsii, Vol. 30, No. 1, 3-12.

[90]

Messy broadcasting in networks, (with H.S. Haroutunian and L.H. Khachatrian), Preprint 93-075, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Special volume in honour of J.L. Massey on occasion of his 60th birthday. Communications and Cryptography (Two sides of one tapestry), editors R.E. Blahut, D.J. Costello, U. Maurer, T. Mittelholzer, Kluwer Acad. Publ., 1994, 13-24.

[91]

Binary constant weight codes correcting localized errors and defects, (with L.A. Bassalygo and M.S. Pinsker), Preprint 93-025, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Probl. Peredachi Informatsii, Vol. 30, No. 2, 10-13 (In Russian); Probl. of Inf. Transmission, 102-104.

[92]

On sets of words with pairwise common letter in different positions, (with N. Cai), Preprint 91-050, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Proc. Colloquium on Extremal Problems for Finite Sets, Visograd, Bolyai Siciety Math. Studies, 3, Hungary, 25-38.

[93]

On multi-user write-efficient memories, (with Z. Zhang), IEEE Trans. Inf. Theory, Vol. 40, No. 3, 674-686.

[94]

On communication complexity of vector-valued functions, (with N. Cai), Preprint 91-041, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 40, No. 6, 2062-2067.

[95]

On partitioning and packing products with rectangles, (with N. Cai), Preprint 93-008, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Combinatorics, Probability & Computing 3, 429-434.

[96]

A new direction in extremal theory for graphs, (with N. Cai and Z. Zhang), J. Combinatorics, Information & System Sciences, Vol. 19, No. 3-4, 269-280.

[97]

Asymptotically optimal binary codes of polynomial complexity correcting localized errors, (with L.A. Bassalygo and M.S. Pinsker), Preprint 94-055, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Proc. IV International workshop on Algebraic and Combinatorial Coding Theory, Novgorod, Russia, 1-3.

1995

[98]

Localized random and arbitrary errors in the light of AV channel theory, (with L.A. Bassalygo and M.S. Pinsker), Preprint 93-036, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 41, No. 1, 14-25.

[99]

Edge isoperimetric theorems for integer point arrays, (with S.L. Bezrukov), Preprint 94-067, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Applied Math. Letters, Vol. 8, No. 2, 75-80.

[100]

New directions in the theory of identification via channels, (with Z. Zhang), Preprint 94-010, SFB 343 ``Diskrete Strukturen in der Mathematik, Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 41, No. 4, 1040-1050.

[101]

Towards characterising equality in correlation inequalities, (with L.H. Khachatrian), Preprint 93-027, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, European J. of Combinatorics 16, 315-328.

[102]

Maximal sets of numbers not containing $k+1$ pairwise coprime integers, (with L.H. Khachatrian), Preprint 94-080, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Acta Arithmetica LXX II, 1, 77-100.

[103]

Density inequalities for sets of multiples, (with L.H. Khachatrian), Preprint 93-049, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, J. of Number Theory, Vol. 55, No. 2., 170-180.

[104]

A splitting property of maximal antichains, (with P.L. Erdos and N. Graham), Preprint 94-048, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Combinatorica 15 (4), 475-480.

1996

[105]

Sets of integers and quasi-integers with pairwise common divisor, (with L.H. Khachatrian), Preprint 95-036, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Acta Arithmetica, LXXIV.2, 141-153.

[106]

A counterexample to Aharoni's ``Strongly maximal matching'' conjecture, (with L.H. Khachatrian), included in ``Report on work in progress in combinatorial extremal theory'', Ergänzungsreihe des SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Nr. 95-004, Discrete Mathematics 149, 289.

[107]

Erasure, list, and detection zero-error capacities for low noise and a relation to identification, (with N. Cai and Z. Zhang), Preprint 93-068, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 42, No. 1, 55-62.

[108]

Optimal pairs of incomparable clouds in multisets, (with L.H. Khachatrian), Preprint 93-043, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Graphs and Combinatorics 12, 97-137.

[109]

Sets of integers with pairwise common divisor and a factor from a specified set of primes, (with L.H. Khachatrian), Preprint 95-059, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Acta Arithmetica LXX V 3, 259-276.

[110]

Cross-disjoint pairs of clouds in the interval lattice, (with N. Cai), Preprint 93-038, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, The Mathematics of Paul Erdos, Vol. I; R.L. Graham and J. Nesetril, ed., Algorithms and Combinatorics B, Springer Verlag, Berlin/Heidelberg/New York, 155-164.

[111]

Identification under random processes, (with V. Balakirsky), Preprint 95-098, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Problemy peredachii informatsii (special issue devoted to M.S. Pinsker), vol. 32, no. 1, 144-160, Jan.-March 1996; Problems of Information Transmission, Vol. 32, No. 1, 123-138.

[112]

Report on work in progress in combinatorial extremal theory: Shadows, AZ-identity, matching. Ergänzungsreihe des SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Nr. 95-004.

[113]

Fault-tolerant minimum broadcast networks, (with L. Gargano, H.S. Haroutunian, and L.H. Khachatrian), Preprint 94-032, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Networks, Vol. 27, No. 4, 1293-1307.

[114]

The complete nontrivial-intersection theorem for systems of finite sets, (with L.H. Khachatrian), Preprint 95-102, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, J. Combinatorial Theory, Series A, 121-138.

[115]

Incomparability and intersection properties of Boolean interval lattices and chain posets, (with N. Cai), Preprint 93-037, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, European J. of Combinatorics 17, 677-687.

[116]

Classical results on primitive and recent results on cross-primitive sequences, (with L.H. Khachatrian), Preprint 93-042, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, The Mathematics of P. Erdos, Vol. I; R.L. Graham and J. Nesetril, ed., Algorithms and Combinatorics B, Springer Verlag, Berlin/Heidelberg/ New York, 104-116.

[117]

Intersecting Systems, (with N. Alon, P.L. Erdos, M. Ruszinko, L.A. Székely), Preprint Supplement 01-003, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Combinatorics, Probability and Computing 6, 127-137.

[118]

Some properties of fix-free codes, (with B. Balkenhol and L.H. Khachatrian), Proceedings First INTAS International Seminar on Coding Theory and Combinatorics 1996, Thahkadzor, Armenia, 20-33, 6-11 October 1996.

[119]

Higher level extremal problems, (with N. Cai and Z. Zhang), Preprint 92-031, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Comb. Inf. & Syst. Sc., Vol. 21, No. 3-4, 185-210.

1997

[120]

On interactive communication, (with N. Cai and Z. Zhang), Preprint 93-066, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 43, No. 1, 22-37.

[121]

Identification via compressed data, (with E. Yang and Z. Zhang), Preprint 95-007, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 43, No. 1, 48-70.

[122]

The complete intersection theorem for systems of finite sets, (with L.H. Khachatrian), Preprint 95-066, SFB 343 ``Diskrete Strukturen in der Mathematik'', European J. Combinatorics, 18, 125-136.

[123]

Universal coding of integers and unbounded search trees, (with T.S. Han and K. Kobayashi), Preprint 95-001, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Trans. Inf. Theory, Vol. 43, No. 2, 669-682.

[124]

Number theoretic correlation inequalities for Dirichlet densities, (with L.H. Khachatrian), Preprint 93-060, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, J. Number Theory, Vol. 63, No. 1, 34-46.

[125]

General edge-isoperimetric inequalities, Part 1: Information theoretical methods, (with Ning Cai), Preprint 94-090, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, European J. of Combinatorics 18, 355-372.

[126]

General edge-isoperimetric inequalities, Part 2: A local-global principle for lexicographical solutions, (with Ning Cai), Preprint 94-090, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, European J. of Combinatorics 18, 479-489.

[127]

Models of multi-user write-efficient memories and general diametric theorems, (with N. Cai), Preprint 93-019, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Information and Computation, Vol. 135, No. 1, 37-67.

[128]

Shadows and isoperimetry under the sequence-subsequence relation, (with N. Cai), Preprint 95-045, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Combinatorica 17 (1), 11-29.

[129]

Counterexample to the Frankl/Pach conjecture for uniform, dense families, (with L.H. Khachatrian), Preprint 95-114, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Combinatorica 17 (2), 299-301.

[130]

Correlated sources help the transmission over AVC, (with N. Cai), Preprint 95-106, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 135, No. 1, 37-67.

1998

[131]

Common randomness in Information Theory and Cryptography, Part II: CR capacity, (with I. Csiszár), Preprint 95-101, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 44, No. 1, 55-62.

[132]

The diametric theorem in Hamming spaces -- optimal anticodes, (with L.H. Khachatrian) Preprint 96-013, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Proceedings First INTAS International Seminar on Coding Theory and Combinatorics 1996, Thahkadzor, Armenia, 1-19, 6-11 October 1996; Advances in Applied Mathematics 20, 429-449.

[133]

Information and Control: Matching channels, (with N. Cai), Preprint 95-035, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 44, No. 2, 542-563.

[134]

Zero-error capacity for models with memory and the enlightened dictator channel, (with N. Cai and Z. Zhang), IEEE Trans. Inf. Theory, Vol. 44, No. 3, 1250-1252.

[135]

Code pairs with specified parity of the Hamming distances, (with Z. Zhang), Preprint 96-058, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Discrete Mathematics 188, 1-11.

[136]

Isoperimetric theorems in the binary sequences of finite lengths, (with Ning Cai), Applied Math. Letters, Vol. 11, No. 5, 121-126.

[137]

The intersection theorem for direct products, (with H. Aydinian and L.H. Khachatrian), Preprint 97-051, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, European Journal of Combinatorics 19, 649-661.

1999

[138]

Construction of uniquely decodable codes for the two-user binary adder channel, (with V.B. Balakirsky), Preprint 97-016, SFB 343 ``Diskrete Strukturen in der Mathematik'', IEEE Trans. Inf. Theory, Vol 45, No. 1, 326-330.

[139]

Arbitrarily varying multiple-access channels, Part I. Ericson's symmetrizability is adequate, Gubner's conjecture is true, (with N. Cai), Preprint 96-068, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 45, No. 2, 742-749.

[140]

Arbitrarily varying multiple-access channels, Part II. Correlated sender's side information, correlated messages, and ambiguous transmission, (with N. Cai), Preprint 97-006, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 45, No. 2, 749-756.

[141]

A pushing-pulling method: new proofs of intersection theorems, (with L.H. Khachatrian), Preprint 97-043, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Combinatorica 19(1), 1-15.

[142]

A counterexample in rate-distortion theory for correlated sources, (with Ning Cai), Preprint 97-034, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Applied Math. Letters, Vol. 12, No. 7, 1-3.

[143]

On maximal shadows of members in left-compressed sets, (with Zhen Zhang), Preprint 97-026, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Proceedings of the Rostock Conference, Discrete Applied Math. 95, 3-9.

[144]

A counterexample to Kleitman's conjecture concerning an edge-isoperimetric problem, (with Ning Cai), Preprint 00-121, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Combinatorics, Probability and Computing 8, 301-305.

[145]

Identification without randomization, (with Ning Cai), Preprint 98-075, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 45, No. 7, 2636-2642.

[146]

On the quotient sequence of sequences of integers, (with L.H. Khachatrian and A. Sárközy), Preprint 98-068, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Acta Arithmetica, XCI.2, 117-132.

[147]

On the counting function for primitive sets of integers, (with L.H. Khachatrian and A. Sárközy), Preprint 98-077, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, J. Number Theory 79, 330-344.

[148]

On the Hamming bound for nonbinary localized-error-correcting codes, (with L.A. Bassalygo and M.S. Pinsker), Preprint 99-077, SFB 343, Diskrete Strukturen in der Mathematik, Universität Bielefeld, Problemy Per. Informatsii, Vol. 35, No. 2, 29-37, Probl. of Inf. Transmission, Vol. 35, No. 2, 117-124.

2000

[149]

On prefix-free and suffix-free sequences of integers, (with L.H. Khachatrian and A. Sárközy), Preprint 99-050, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Numbers, Information and Complexity, Special volume in honour of R. Ahlswede on occasion of his 60th birthday, editors I. Althöfer, N. Cai, G. Dueck, L.H. Khachatrian, M. Pinsker, A. Sárközy, I. Wegener, and Z. Zhang, Kluwer Acad. Publ., Boston, Dordrecht, London, 1-16.

[150]

Splitting properties in partially ordered sets and set systems, (with L.H. Khachatrian), Preprint 94-071, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Numbers, Information and Complexity, Special volume in honour of R. Ahlswede on occasion of his 60th birthday, editors I. Althöfer, N. Cai, G. Dueck, L.H. Khachatrian, M. Pinsker, A. Sárközy, I. Wegener, and Z. Zhang, Kluwer Acad. Publ., Boston, Dordrecht, London, 29-44.

[151]

The AVC with noiseless feedback and maximal error probability: A capacity formula with a trichotomy, (with N. Cai), Preprint 96-064, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Numbers, Information and Complexity, Special volume in honour of R. Ahlswede on occasion of his 60th birthday, editors I. Althöfer, N. Cai, G. Dueck, L.H. Khachatrian, M. Pinsker, A. Sárközy, I. Wegener, and Z. Zhang, Kluwer Acad. Publ., Boston, Dordrecht, London, 151-176.

[152]

A diametric theorem for edges, (with L.H. Khachatrian), Preprint 97-100, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, J. Comb. Theory, Series A 92, 1-16.

[153]

Network information flow, (with Ning Cai, S.Y. Robert Li, and Raymond W. Yeung), Preprint 98-033, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 46, No. 4, 1204-1216.

2001

[154]

On perfect codes and related concepts, (with H. Aydinian and L.H. Khachatrian), Preprint 98-080, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Designs, Codes and Cryptography, 22, 221-237.

[155]

Quantum data processing, (with Peter Löber), Preprint 99-087, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 47, No. 1, 474-478.

[156]

On primitive sets of squarefree integers, (with L.H. Khachatrian and A. Sárközy), Preprint 99-093, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Periodica Mathematica Hungarica Vol. 42 (1-2), 99-115.

[157]

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.

[158]

An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection, (with N. Cai and C. Deppe), Preprint 00-115, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Problemy Peredachi Informatsii, No. 4, 63-70, 2001, Translation Problems of Information Transmission, Vol. 37, No. 4, 332-338.

2002

[159]

Strong converse for identification via quantum channels, (with A. Winter), Preprint 00-122, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 48, No. 3, 569-579.

[160]

Parallel error correcting codes, (with B. Balkenhol and N. Cai), Preprint 00-114, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 48, No. 4, 959-962.

[161]

Semi-noisy deterministic multiple-access channels: coding theorems for list codes and codes with feedback, (with N. Cai), Preprint 00-022, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, IEEE Trans. Inf. Theory, Vol. 48, No. 8, 2953-2962.

[162]

The $t$-intersection problem in the truncated Boolean lattice, (with C. Bey, K. Engel, and L.H. Khachatrian), Preprint 99-104, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, European Journal of Combinatorics 23, 471-487.

[163]

Undirectional error control codes and related combinatorial problems, (with H. Aydinian and L.H. Khachatrian), in Proceedings of Eight International workshop on Algebraic and Combinatorial Coding Theory, 8-14 September, Tsarskoe Selo, Russia, 6-9.

2003

[164]

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

[165]

Cone dependence -- a basic combinatorial concept, (with L.H. Khachatrian), Preprint 00-117, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Designs, Codes and Cryptography, 29, 29-40.

[166]

More about shifting techniques, (with H. Aydinian and L.H. Khachatrian), Preprint 00-127, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, European Journal of Combinatorics 24, 551-556.

[167]

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

[168]

Maximum number of constant weight vertices of the unit $n$-cube contained in a $k$-dimensional subspace, (with H. Aydinian and L.H. Khachatrian), Preprint 99-118, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Combinatorica, Vol. 23 (1), 5-22.

[169]

A complexity measure for families of binary sequences (with L.H. Khachatrian, C. Mauduit, and A. Sárközy), Preprint Supplement 01-007, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Periodica Mathematica Hungarica, Vol. 46 (2), 107-118.

[170]

Extremal problems under dimension constraints, (with H. Aydinian and L.H. Khachatrian), Preprint 00-116, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Discrete Mathematics, Special issue: EuroComb'01 - Edited by J. Nesetril, M. Noy and O. Serra, Vol. 273, No. 1-3, 9-21.

[171]

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

[172]

Large deviations in quantum information theory, (with V. Blinovsky), Probl. of Inf. Transmission, Vol. 39, Issue 4, 373-379.

2004

[173]

On Bohman's conjecture related to a sum packing problem of Erdos, (with H. Aydinian and L.H. Khachatrian), Proceedings of the American Mathematical Society, Vol. 132, No. 5, 1257-1265.

[174]

On shadows of intersecting families, (with H. Aydinian and L.H. Khachatrian), Combinatorica ...

[175]

Four proofs of Katona's Intersection Theorem, (with L.H. Khachatrian), Combinatorica ...

[176]

On lossless quantum data compression with a classical helper, (with Ning Cai), IEEE Trans. Inf. Theory, Vol. 50, No. 6,

to appear

[177]

$t$-Shift synchronization Codes'', (with B. Balkenhol, C. Deppe, H. Mashurian and T. Partner), General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[178]

Search with noisy and delayed responses, (with N. Cai), General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[179]

Watermarking identification codes with related topics in common randomness, (with N. Cai), General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[180]

Large families of pseudorandom sequences of $k$ symbols and their complexity, Part I, (with C. Mauduit and A. Sárközy), General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[181]

Large families of pseudorandom sequences of $k$ symbols and their complexity, Part II, (with C. Mauduit and A. Sárközy), General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[182]

A Kraft-type inequality for $d$-delay binary search codes, (with N. Cai), General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[183]

Sparse asymmetric connectors in communication networks, (with H. Aydinian) General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[184]

A strong converse theorem for quantum multiple access channels, (with N. Cai), General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[185]

Codes with identifiable parent property and the multiple-access channel, (with N. Cai) General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[186]

Estimating with randomized encoding the joint empirical distribution in a correlated source, (with Zhen Zhang), General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai; (Preliminary version: Worst case estimation of permutation invariant functions and identification via compressed data, (with Zhen Zhang), Preprint 97-005, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld).

[187]

On the density of primitive sets, (with L.H. Khachatrian and A. Sárközy), Preprint 00-112, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, J. Number Theory ...

[188]

On attractive and friendly sets in sequence spaces, (with L.H. Khachatrian), Preprint Supplement 01-004, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Gedenkband für Walter Deuber ...

[189]

Information theoretic models in language evolution, (with E. Arikan, L. Bäumer and C. Deppe), General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai. Acepted as Language Evolution and Information Theory in ISIT, Chicago June 27-July 2, 1004.

[190]

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

submitted

[191]

A fast suffix-sorting algorithm, (with B. Balkenhol and M. Fröhlich), Preprint Supplement 01-005, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, ...

[192]

Intersection theorems under dimension constraints: the restricted case, (with H. Aydinian and L.H. Khachatrian), Preprint Supplement 00-132, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, J. Comb. Theory ...

[193]

Partition of a rectangle into rectangles with restricted partition number of cross sections, (with A. Yudin), Preprint 00-128, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, Gedenkband für Walter Deuber ...

[194]

Intersection theorems under dimension constraints: the unrestricted case, (with H. Aydinian and L.H. Khachatrian), Preprint Supplement 00-132, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, J. Comb. Theory ...

[195]

Forbidden (0,1)-vectors in Hyperplanes of $\mathbb{R}^n$: The unrestricted case, Designs, Codes and Cryptography ...

[196]

General theory of information transfer, Preprint 97-118, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[197]

Concepts of performance parameters for channels, Preprint 00-126, SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[198]

Information theoretic models in language evolution, (with L. Bäumer and C. Deppe), General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[199]

On switching for hypergraphs, (with V. Blinovsky), General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[200]

Correlation inequalities in function space, (with V. Blinovsky), General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[201]

Giant $k$-core in random hypergraph, (with V. Blinovsky) General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[202]

Separating systems with restrictions in search and diagonosis, General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.

[203]

Report on models of write-efficient memories with localized errors and defects, (with M.S. Pinsker), Preprint 97-004 (Ergänzungsreihe), SFB 343 ``Diskrete Strukturen in der Mathematik'', Universität Bielefeld, General Theory of Information Transfer and Combinatorics, Report on a Research Project at the ZIF (Center of interdisciplinary studies) in Bielefeld Oct. 1, 2002 - August 31, 2003, edit R. Ahlswede with the assistance of L. Bäumer and N. Cai.