Pages that link to "Item:Q5675266"
From MaRDI portal
The following pages link to On the converse to the coding theorem for discrete memoryless channels (Corresp.) (Q5675266):
Displaying 11 items.
- On the second-order asymptotics for entanglement-assisted communication (Q332056) (← links)
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy (Q742865) (← links)
- Properties of noncommutative Rényi and Augustin information (Q2113490) (← links)
- Strong converse for the feedback-assisted classical capacity of entanglement-breaking channels (Q2190914) (← links)
- Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity (Q2258018) (← links)
- Second-order asymptotics for the classical capacity of image-additive quantum channels (Q2354350) (← links)
- Moderate deviation analysis for classical communication over quantum channels (Q2406109) (← links)
- Strong converse exponent for classical-quantum channel coding (Q2408555) (← links)
- Strong converse theorems using Rényi entropies (Q2820904) (← links)
- Bounds on Data Compression Ratio with a Given Tolerable Error Probability (Q4266369) (← links)
- Quantifying information flow in cryptographic systems (Q5740629) (← links)
