A general formula for channel capacity
From MaRDI portal
Publication:4324176
DOI10.1109/18.335960zbMath0819.94016OpenAlexW2020347709MaRDI QIDQ4324176
Publication date: 1 March 1995
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.335960
error probabilitychannel capacityShannon theorystrong conversechannel coding theoremchannels with memory\(m\)-ary hypothesis tests
Parametric hypothesis testing (62F03) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)
Related Items (8)
Efficient information transfer by Poisson neurons ⋮ Universal coding for classical-quantum channel ⋮ Asymptotic convertibility of entanglement: An information-spectrum approach to entanglement concentration and dilution ⋮ Second-order asymptotics for quantum hypothesis testing ⋮ Distributions and channel capacities in generalized statistical mechanics ⋮ Second-order converses via reverse hypercontractivity ⋮ Design of Information Channels for Optimization and Stabilization in Networked Control ⋮ Common Information, Noise Stability, and Their Extensions
This page was built for publication: A general formula for channel capacity