Westfälisches Urkundenbuch /
Additamenta : Orts- und PersonenregisterNeudr. d. Ausg. Münster 1877, 1973
Die Wunderkur und etzliche andere ergetzliche Sächelchen
Berlin : Dt. Buch-Gemeinschaft, [circa 1924]
Experimental thermodynamics of the helix-random coil transition. I. Influence of polymer concentration and solvent composition in the PBG-DCA-EDC system
In: Biopolymers, Jg. 5 H. 7, S. 649-6621967
Polycyclic aromatic hydrocarbon solute probes. Part VII: evaluation of additional coronene derivatives as possible solvent polarity probe molecules
In: Applied Spectroscopy, Jg. 44 H. 3, S. 477-4821990Measurement of the spin-dependent structure function g1(x) of the proton
In: Phys.Lett. B, Jg. 329 H. 2-3, S. 399-4061994Spin asymmetry in muon-proton deep inelastic scattering on a transversely-polarized target
In: Phys. Lett. B, Jg. 336 H. 1, S. 125-1301994Measurement of the polarisation of a high energy muon beam
In: Nucl.Instrum.Meth. A, Jg. 343 H. 2-3, S. 363-3731994Measurement of the spin-dependent structure function g1(x) of the deuteron
In: Phys.Lett. B, Jg. 302 H. 4, S. 533-5391993Measurement of the deuteron polarization in a large target
In: Nucl.Instrum.Meth. A, Jg. 349 H. 2-3, S. 334-3441994Combined analysis of world data on nucleon spin structure functions
In: Phys.Lett. B, Jg. 320 H. 3-4, S. 400-4061994Stoicorvm vetervm fragmenta /
4 : Quo indices continentur / conscripsit Maximilianus AdlerLipsiae : Teubner, 1924Zur Effektivität verschiedener Instruktionstypen für die Vermittlung einer komplexen zielsprachlichen Struktur.
In: FLuL (Fremdsprachen Lehren und Lernen), Jg. 29, S. 191-2182000Biologisch abbaubare Tenside aus nachwachsenden Rohstoffen: N-Acylaminosäuren
Synthesen und Tensideigenschaften1999An elementary proof of the strong converse theorem for the multiple-access channel
In: J. Combinatorics, Information and System Sciences, Jg. 7 H. 3, S. 216-2301982Arbitrarily varying channels with states sequence known to the sender
In: IEEE transactions on information theory, Jg. 32 H. 5, S. 621-6291986Beiträge zur Shannonschen Informationstheorie im Falle nichtstationärer Kanäle
In: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 10 H. 1, S. 1-421968The capacity region of a channel with two senders and two receivers
In: The annals of probability, Jg. 2 H. 5, S. 805-8141974Channels with arbitrarily varying channel probability functions in the presence of noiseless feedback
In: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 25 H. 3, S. 239-2521973Coloring hypergraphs: A new approach to multi-user source coding, 1
In: Journal of combinatorics, information & system sciences, Jg. 4 H. 1, S. 76-1151979Coloring hypergraphs: A new approach to multi-user source coding, 2
In: Journal of combinatorics, information & system sciences, Jg. 5 H. 3, S. 220-2681980Elimination of correlation in random codes for arbitrarily varying channels
In: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 44 H. 2, S. 159-1751978Extremal properties of rate distortion functions
In: IEEE transactions on information theory, Jg. 36 H. 1, S. 166-1711990Group Codes do not Achieve Shannon's Channel Capacity for General Discrete Channels
In: The Annals of Mathematical Statistics, Jg. 42 H. 1, S. 224-2401971Improvements of Winograd's result on computation in the presence of noise
In: IEEE transactions on information theory, Jg. 30 H. 6, S. 872-8771984The maximal error capacity of arbitrarily varying channels for constant list sizes
In: IEEE transactions on information theory, Jg. 39 H. 4, S. 1416-14171993A method of coding and its application to arbitrarily varying channels
In: Journal of combinatorics, information and system sciences, Jg. 5 H. 1, S. 10-351980A 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
In: The annals of mathematical statistics, Jg. 41 H. 3, S. 1027-10331970On multiple descriptions and team guessing
In: IEEE transactions on information theory, Jg. 32 H. 4, S. 543-5491986The rate-distortion region for multiple descriptions without excess rate
In: IEEE transactions on information theory, Jg. 31 H. 6, S. 721-7261985Remarks on Shannon's secrecy systems
In: Problems of Control and Information Theory, Jg. 11 H. 4, S. 301-3181982Simple hypergraphs with maximal number of adjacent pairs of edges
In: Journal of Combinatorial Theory, Series B, Jg. 28 H. 2, S. 164-1671980The weak capacity of averaged channels
In: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 11 H. 1, S. 61-731968The asymptotic behavior of diameters in the average
In: Journal of Combinatorial Theory, Series B, Jg. 61 H. 2, S. 167-1771994Asymptotically dense nonbinary codes correcting a constant number of localized errors [Manuskript]
In: Comptes rendus de l' Académie bulgare des Sciences, Jg. 46 H. 1, S. 35-371993Asymptotically optimal binary codes of polynomial complexity correcting localized errors
In: Probl. Peredachi Inf., Jg. 31 H. 2, S. 76-831995Binary constant-weight codes correcting localized errors and defects
In: Problems of information transmission, Jg. 30 H. 2, S. 102-1041994Nonbinary codes correcting localized errors
In: IEEE transactions on information theory, Jg. 39 H. 4, S. 1413-14161993Approximation o continuous functions in p-Adic Analysis
In: Journal of Approximation Theory, Jg. 15 H. 3, S. 190-2051975On minimax estimation in the presence of side information about remote data
In: The annals of statistics, Jg. 18 H. 1, S. 141-1711990On communication complexity of vector-valued functions
In: IEEE transactions on information theory, Jg. 40 H. 6, S. 2062-20671994On extremal set partitions in Cartesian product spaces
In: Combinatorics, Probability & Computing, Jg. 2 H. 2, S. 211-2201993On partitioning and packing products with rectangles
In: Combinatorics, Probability & Computing, Jg. 3 H. 04, S. 429-4341994Rank formulas for certain products of matrices
In: Applicable Algebra in Engineering, Communication and Computing, Jg. 4 H. 4, S. 253-2611993Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
In: IEEE transactions on information theory, Jg. 37 H. 6, S. 1647-16491991Two-way communication complexity of sum-type functions for one processor to be informed
In: Problems of information transmission, Jg. 30 H. 1, S. 3-101994A general 4-words inequality with consequences for 2-way communication complexity
In: Advances in Applied Mathematics, Jg. 10 H. 1, S. 75-941989A new direction in extremal theory
In: Journal of combinatorics, information and system sciences, Jg. 19 H. 3, S. 269-2801994Rich colorings with local constraints
In: Journal of combinatorics, information & system sciences, Jg. 17 H. 3, S. 203-2161992Common randomness in information theory and cryptography. Part I: secret sharing
In: IEEE transactions on information theory, Jg. 39 H. 4, S. 1121-11321993Hypothesis testing with communication constraints
In: IEEE transactions on information theory, Jg. 32 H. 4, S. 533-5421986To get a bit of information may be as hard as to get full information
In: IEEE transactions on information theory, Jg. 27 H. 4, S. 398-4081981An inequality for the weights of two families of sets, their unions and intersections
In: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 43 H. 3, S. 183-1851978Inequalities for a pair of maps S x S -> S with S a finite set
In: Mathematische Zeitschrift, Jg. 165 H. 3, S. 267-2891979Integral inequalities for increasing functions
In: Mathematical Proceedings of the Cambridge Philosophical Society, Jg. 86 H. 03, S. 391-3941979The number of values of combinatorial functions
In: Bulletin of the London Mathematical Society, Jg. 11 H. 1, S. 49-511979Bad codes are good ciphers
In: Problems of Control and Information Theory, Jg. 11 H. 5, S. 337-3511982Every bad code has a good subcode: a local converse to the coding theorem
In: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 34 H. 2, S. 179-1821976Good codes can be produced by a few permutations
In: IEEE transactions on information theory, Jg. 28 H. 3, S. 430-4431982Identification in the presence of feedback: a discovery of new capacity formulas
In: IEEE transactions on information theory, Jg. 35 H. 1, S. 30-361989Bounds on algebraic code capacities for noisy channels. I
In: Information and Control, Jg. 18 H. 2, S. 124-1451971Bounds on algebraic code capacities for noisy channels. II
In: Information and Control, Jg. 19 H. 2, S. 146-1581971Spreading of sets in product spaces and hypercontraction of the Markov operator
In: The annals of probability, Jg. 4 H. 6, S. 925-9391976Bounds on conditional probabilities with applications in multi-user communication
In: Zeitschrift fr Wahrscheinlichkeitstheorie und Verwandte Gebiete, Jg. 34 H. 2, S. 157-1771976Correction to: Bounds on conditional probabilities with applications
In: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, Jg. 39 H. 4, S. 353-3541977On source coding with side information via a multiple-access channel and related problems in multi-user information theory
In: IEEE transactions on information theory, Jg. 29 H. 3, S. 396-4121983Messy broadcasting in networks
In: Communications and cryptography: two sides of one tapestry, Jg. 276, S. 13-241994Optimal coding strategies for certain permuting channels
In: IEEE transactions on information theory, Jg. 33 H. 3, S. 310-3141987Graphs with maximal number of adjacent pairs of edges
In: Acta mathematica Academiae Scientiarum Hungaricae, Jg. 32 H. 1-2, S. 97-1201978Note on an extremal problem arising for unreliable networks in parallel computing
In: Discrete Mathematics, Jg. 47, S. 137-1521983