Bounds on conditional probabilities with applications in multi-user communication
From MaRDI portal
Publication:4120510
DOI10.1007/BF00535682zbMath0349.94038OpenAlexW2014031743MaRDI QIDQ4120510
János Körner, Peter Gács, Rudolf Ahlswede
Publication date: 1976
Published in: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00535682
Related Items
The positive-divergence and blowing-up properties, A measure concentration inequality for contracting Markov chains, Shadows and isoperimetry under the sequence-subsequence relation, Multiple-user communication, Measure concentration and the weak Pinsker property, Efficient blocking probability computation of complex traffic flows for network dimensioning, Concentration inequalities using the entropy method, A sharp concentration inequality with applications, Every bad code has a good subcode: A local converse to the coding theorem, Unnamed Item, Contributions to the geometry of Hamming spaces, Capacity region of degraded broadcast channels with feedback, Concentration inequalities for dependent random variables via the martingale method, Exponential integrability and transportation cost related to logarithmic Sobolev inequalities, Bounding \(\bar d\)-distance by informational divergence: A method to prove measure concentration, Note on an extremal problem arising for unreliable networks in parallel computing, Codes with the identifiable parent property and the multiple–access channel
Cites Work
