Error Exponent for Multiple-Access Channels: Lower Bounds
From MaRDI portal
Cited in
(16)- Lower bounds for the cardinality of error-correcting codes in channels with multiple access
- On product form approximations for communication networks with losses: Error bounds
- Error exponents for Nakagami-\(m\) fading channels
- Error Exponent for Multiple Access Channels: Upper Bounds
- Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels
- On Witsenhausen's zero-error rate for multiple sources
- Minimum probability of error for asynchronous Gaussian multiple-access channels
- scientific article; zbMATH DE number 4010386 (Why is no real title available?)
- Error Exponents of Optimum Decoding for the Interference Channel
- Error Exponents for Asynchronous Multiple Access Channels, Controlled Asynchronism May Outperform Synchronism
- Exact Error and Erasure Exponents for the Asymmetric Broadcast Channel
- Error Exponents for Dimension-Matched Vector Multiple Access Channels With Additive Noise
- Expurgated Bounds for the Asymmetric Broadcast Channel
- Error Exponents for Broadcast Channels With Degraded Message Sets
- scientific article; zbMATH DE number 3405822 (Why is no real title available?)
- A toolbox for refined information-theoretic analyses
This page was built for publication: Error Exponent for Multiple-Access Channels: Lower Bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986132)