Computation of channel capacity and rate-distortion functions
Explore this paper's citation graph
Summary
A simple algorithm for computing channel capacity is suggested that consists of a mapping from the set of channel input probability vectors into itself such that the sequence of probability vectors generated by successive applications of the mapping converges to the vector that achieves the capacity of the given channel.
- Type
- article
- Published
- 1972-07-01
- Cited by
- 1,600
- References
- 12
- OpenAlex
- https://openalex.org/W2148986322
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:18060654
Keywords
Channel capacity, Channel (broadcasting), Distortion (music), Algorithm, Mathematics
References
- Mathematical Problems in the Shannon Theory of Optimal Coding of Information
- Rate distortion theory : a mathematical basis for data compression
- Information Theory and Reliable Communication
- An algorithm for computing the capacity of arbitrary discrete memoryless channels
- The computation and bounding of rate-distortion functions
- Bounds on the rate-distortion function for stationary sources with memory
- Coding for a discrete information source with a distortion measure
Cited by
- Sufficient encoding of dynamical systems
- Joint Source-Channel Coding Using Real BCH Codes for Robust Image Transmission
- Keep Your Options Open: An Information-Based Driving Principle for Sensorimotor Systems
- On Achievable Rate Regions for Source Coding over Networks
- Shannon-Optimal Priors on iid Statistical Experiments Converge Weakly to Jeffreys Prior
- Shannon capacity of nonlinear communication channels
- Proximal methods for convex minimization of Phi-divergences : application to computer vision.
- Optimisation de la quantification vectorielle codée par treillis: application au codage des paramètres LSF
- Remote Source Coding and AWGN CEO Problems
- Performance limits of brain machine interfaces
- MIMO Communication Capacity: Antenna Coupling and Precoding for Incoherent Detection
- On the Usage of Parasitic Antenna Elements in Wireless Communication Systems
- Informational Constraints and Organisation of Behaviour
- Joint Source-Channel Coding for Image Transmission over Flat Fading Channels
- Efficient Polar and LDPC Coding for Asymmetric Channels and Sources
- Optimal Parametric Backward-Adaptive Lossy Compression ∗
- Real-time Estimation of a Markov Process Over a Noisy Digital Communication Channel
- Some new developments in image compression
- Rate Distortion Theory for General Sources With Potential Application to Image Compression
- Mathematical Modeling of Oxygen Transport, Cell Killing and Cell Decision Making in Photodynamic Therapy of Cancer
Related papers
- Capacity-approaching codes on the q-ary symmetric channel for large q
- Relations between belief propagation on erasure and symmetric channels
- The Interactive Capacity of the Binary Symmetric Channel is at Least 1/40 the Shannon Capacity
- A Survey of Results for Deletion Channels and Related Synchronization Channels
- On Extrinsic Information of Good Codes Operating Over Memoryless Channels with Incremental Noisiness
- Dual Capacity Upper Bounds for Noisy Runlength Constrained Channels