Blahut–Arimoto algorithm
Class of algorithms in information theory
The term Blahut–Arimoto algorithm is often used to refer to a class of algorithms for computing numerically either the information theoretic capacity of a channel, the rate-distortion function of a source or a source encoding (i.e. compression to remove the redundancy). They are iterative algorithms that eventually converge to one of the maxima of the optimization problem that is associated with these information theoretic concepts.
Nº Q4923900 ★★★
Rara · Saberes
Blahut–Arimoto algorithm
Class of algorithms in information theory
The term Blahut–Arimoto algorithm is often used to refer to a class of algorithms for computing numerically either the information theoretic capacity of a channel, the rate-distortion function of a source or a source encoding (i.e. compression to remove the redundancy). They are iterative algorithms that eventually converge to one of the maxima of the optimization problem that is associated with these information theoretic concepts.
Último precio
—
Precio mínimo
—
Mediana 7 d
—
Ventas 30 d
0
Rango 30 d
—
En circulación
0
Cotización
mediana
mín – máx
ventas
Sin ventas en el periodo
Ver tabla
| Fecha | mediana | Mín | Máx | ventas |
|---|
Historial de ventas
- Última venta
- —
- Media 30 d
- —
- Mínimo 30 d
- —
- Máximo 30 d
- —
- Ventas 7 d
- 0
- Ventas 30 d
- 0
Aún no hay ventas.
Ventas anónimas: sin comprador ni vendedor. Las cifras solo cuentan ventas entre jugadores.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.
The term Blahut–Arimoto algorithm is often used to refer to a class of algorithms for computing numerically either the information theoretic capacity of a channel, the rate-distortion function of a source or a source encoding (i.e. compression to remove the redundancy). They are iterative algorithms that eventually converge to one of the maxima of the optimization problem that is associated with these information theoretic concepts.
Texto: Wikipedia en inglés, CC BY-SA 4.0. ·
Cartas cercanas
Tarjan's strongly connected components algorithm
Graph theory algorithm
Nº Q1972285 ★
Algoritmo de Kabsch
Nº Q6344361 ★
Teorema de muestreo de Nyquist-Shannon
Nº Q679800 ★★★
Teoría de la información
Rama de las matemáticas que estudia la cuantificación, almacenamiento y comunicación de la información digital
Nº Q131222 ★★★
búsqueda dicotómica
Type of search algorithm
Nº Q5272532 ★★★
Método de complementos
Nº Q4741052 ★