1,721,189 research outputs found
Bounds on conditional probabilities with applications in multi-user communication
Full text linkAhlswede R, Gács P, Körner J. Bounds on conditional probabilities with applications in multi-user communication. Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete. 1976;34(2):157-177
On the connection between the entropies of input and output distributions of discrete memoryless channels
Full text linkAhlswede R, Körner J. On the connection between the entropies of input and output distributions of discrete memoryless channels. In: Proceedings of the fifth Conference on Probability Theory. Bucuresti: Ed. Acad. Republicii Socialiste România; 1977: 13-22
Two Batch Search With Lie Cost
No full textAhlswede R, Cicalese F, Deppe C, Vaccaro U. Two Batch Search With Lie Cost. IEEE TRANSACTIONS ON INFORMATION THEORY. 2009;55(4):1433-1439.consider the problem of searching for an unknown number in the search space U = {0, ..., M -1}. q-ary questions can be asked and some of the answers may be wrong. An arbitrary integer weighted bipartite graph Gamma is given, stipulating the cost Gamma(i.j) of each answer j not equal i when the correct answer is i, i.e., the cost of a wrong answer. Correct answers are supposed to be cost-less. It is assumed that a maximum cost e for the sum of the cost of all wrong answers can be afforded by the responder during the whole search. We provide tight upper and lower bounds for the largest size M = M(q, e, Gamma, n) for which it is possible to find an unlinown number x* is an element of U with n q-ary questions and maximum lie cost e. Our results improve the bounds of Cicalese et al. (2004) and Ahlswede et al. (2008). The questions in our strategies can be asked in two batches of nonadaptive questions. Finally, we remark that our results can be further generalized to a wider class of error models including also unidirectional errors
Construction of uniquely decodable codes for the two-user binary adder channel
Full text linkAhlswede R, Balakirsky V. Construction of uniquely decodable codes for the two-user binary adder channel. IEEE Trans. Inf. Theory. 1999;45(1):326-330
Elimination of correlation in random codes for arbitrarily varying channels
Full text linkAhlswede R. Elimination of correlation in random codes for arbitrarily varying channels. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete. 1978;44(2):159-175.The author determines for arbitrarily varying channels a) the average error capacity and b) the maximal error capacity in case of randomized encoding. A formula for the average error capacity in case of randomized encoding was announced several years ago by Dobrushin ([3]). Under a mild regularity condition this formula turns out to be valid and follows as consequence from either a) or b)
Coding for write-efficient memory
Full text linkAhlswede R, Zhang Z. Coding for write-efficient memory. Information and Computation. 1989;83(1):80-97
Every bad code has a good subcode: a local converse to the coding theorem
Full text linkAhlswede R, Dueck G. Every bad code has a good subcode: a local converse to the coding theorem. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete. 1976;34(2):179-182
- …
