Coding capacity for a class of additive channels
From MaRDI portal
Recommendations
Cited in
(18)- On the capacity of a multiple-access vector adder channel
- Capacity and coding for the gilbert-elliott channels
- On the Capacity-Achieving Distribution of the Discrete-Time Noncoherent and Partially Coherent AWGN Channels
- On the Discreteness of Capacity-Achieving Distributions
- On the capacity of channels with Gaussian and non-Gaussian noise
- scientific article; zbMATH DE number 176100 (Why is no real title available?)
- A general formula for the capacity of stationary nonanticipatory channels
- The capacity of coded systems
- The capacity and coding gain of certain checkerboard codes
- Modulation and coding for linear Gaussian channels
- Sensitivity of channel capacity
- Nearly optimal multiuser codes for the binary adder channel
- Nearest neighbor decoding for additive non-Gaussian noise channels
- Capacity-Achieving Guessing Random Additive Noise Decoding
- Capacity and error bounds for a time-continuous Gaussian channel
- Capacity Bounds for Additive Symmetric $\alpha $ -Stable Noise Channels
- Capacity and error exponents of a channel modeled as a linear dynamic system (Corresp.)
- Capacity of dimension-limited channels
This page was built for publication: Coding capacity for a class of additive channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5753873)