An excursion into Markov chains - UNITEXT
Recomienda este artículo a tus amigos:
Based on the encoding process, arithmetic codes can be viewed as tree codes and current proposals for decoding arithmetic codes with forbidden symbols belong to sequential decoding algorithms and their variants. We also propose arithmetic codes with memories which use high memory but low implementation precision arithmetic codes.
69 pages, VIII, 69 p.
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 6 de noviembre de 2009 |
| ISBN13 | 9783031005473 |
| Editores | Springer International Publishing AG |
| Páginas | 69 |
| Dimensiones | 150 × 220 × 10 mm · 169 g |
| Lengua | Inglés |