Bounds on conditional probabilities with applications in multi-user communication

DOI10.1007/BF00535682MaRDI QIDQ4120510zbMATH OpenOpenAlexFDO

Authors Peter Gács, János Körner, 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

Mathematics Subject Classification ID

Information theory (general) (94A15)

Cites work

• scientific article; zbMATH DE number 3112238 (Why is no real title available?)
• scientific article; zbMATH DE number 3167426 (Why is no real title available?)
• scientific article; zbMATH DE number 3521856 (Why is no real title available?)
• scientific article; zbMATH DE number 3570458 (Why is no real title available?)
• scientific article; zbMATH DE number 3215101 (Why is no real title available?)
• scientific article; zbMATH DE number 3241743 (Why is no real title available?)
• A theorem on the entropy of certain binary sequences and applications--II
• Broadcast channels
• Source coding with side information and a converse for degraded broadcast channels

Cited in

(17)

• Exponential integrability and transportation cost related to logarithmic Sobolev inequalities
• Measure concentration and the weak Pinsker property
• Every bad code has a good subcode: A local converse to the coding theorem
• Note on an extremal problem arising for unreliable networks in parallel computing
• Bounding \(\bar d\)-distance by informational divergence: A method to prove measure concentration
• Shadows and isoperimetry under the sequence-subsequence relation
• A measure concentration inequality for contracting Markov chains
• Codes with the identifiable parent property and the multiple–access channel
• Contributions to the geometry of Hamming spaces
• Capacity region of degraded broadcast channels with feedback
• Satisfiability thresholds for regular occupation problems
• Efficient blocking probability computation of complex traffic flows for network dimensioning
• Multiple-user communication
• Concentration inequalities using the entropy method
• Concentration inequalities for dependent random variables via the martingale method
• The positive-divergence and blowing-up properties
• A sharp concentration inequality with applications

This page was built for publication: Bounds on conditional probabilities with applications in multi-user communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4120510)