Pages that link to "Item:Q4120510"
From MaRDI portal
The following pages link to Bounds on conditional probabilities with applications in multi-user communication (Q4120510):
Displaying 17 items.
- Note on an extremal problem arising for unreliable networks in parallel computing (Q786823) (← links)
- Efficient blocking probability computation of complex traffic flows for network dimensioning (Q925826) (← links)
- Multiple-user communication (Q1147675) (← links)
- Contributions to the geometry of Hamming spaces (Q1242920) (← links)
- Capacity region of degraded broadcast channels with feedback (Q1245810) (← links)
- Exponential integrability and transportation cost related to logarithmic Sobolev inequalities (Q1284435) (← links)
- The positive-divergence and blowing-up properties (Q1327514) (← links)
- Shadows and isoperimetry under the sequence-subsequence relation (Q1382388) (← links)
- Concentration inequalities using the entropy method (Q1431503) (← links)
- Measure concentration and the weak Pinsker property (Q1720271) (← links)
- A measure concentration inequality for contracting Markov chains (Q1919146) (← links)
- Concentration inequalities for dependent random variables via the martingale method (Q2519678) (← links)
- Bounding \(\bar d\)-distance by informational divergence: A method to prove measure concentration (Q2563936) (← links)
- Codes with the identifiable parent property and the multiple–access channel (Q3439234) (← links)
- Every bad code has a good subcode: A local converse to the coding theorem (Q4120509) (← links)
- A sharp concentration inequality with applications (Q4487095) (← links)
- (Q5091251) (← links)
