Skip to search formSkip to main contentSkip to account menu

Blahut–Arimoto algorithm

Known as: Blahut-Arimoto algorithm 
The Blahut–Arimoto algorithm, is often used to refer to a class of algorithms for computing numerically either the information theoretic capacity of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Abstract—The classical Blahut–Arimoto algorithm (BAA) optimizes a discrete memoryless source (DMS) at the input of a discrete… 
2014
2014
We propose an iterative method for efficiently approximating the capacity of discrete memoryless channels, possibly having… 
2012
2012
Recent research has shown that many popular web applications are vulnerable to side-channel attacks on encrypted streams of… 
2010
2010
We establish results assessing the fundamental limits on reliable communication over Finite State Channels (FSCs), when the… 
2008
2008
A naturally occurring hemagglutinin (HA) was detected in the plasma of marine mussel P.viridis using mammalian erythrocytes (RBC… 
2002
2002
The success of iterative decoding algorithms for turbo codes, for low density parity check codes, and for related codes has… 
1999
1999
We report new improved photometric redshifts of 1048 galaxies in the Hubble Deep Field. A standard χ2 minimizing method is… 
1999
1999
| The Arimoto-Blahut (AB) algorithm is an iterative procedure for computing the rate-distortion function for a given source and… 
1998
1998
We present a thorough quantitative analysis of the evolution of the colour-magnitude relation for early-type galaxies in 17… 
1997
1997
We consider the possibility of using bright planetary nebulae to study the chemical evolution of their parent galaxies. In…