An application of the neural Hopfield model to the source (optimal) coding problem is presented. This application gives the structure of a Hopfield network, capable of calculating the lengths of the codewords that must be associated to a source alphabet so as to minimize their average length. The case of a stationary and memoryless block-to-variable-length source coding is discussed.
Application of the Hopfield model to Huffman codes / Fabris, Francesco; Ricca, Giacomo Della. - In: IEEE TRANSACTIONS ON INFORMATION THEORY. - ISSN 0018-9448. - 39:3(1993), pp. 1071-1076. [10.1109/18.256519]
Application of the Hopfield model to Huffman codes
Fabris, Francesco;
1993-01-01
Abstract
An application of the neural Hopfield model to the source (optimal) coding problem is presented. This application gives the structure of a Hopfield network, capable of calculating the lengths of the codewords that must be associated to a source alphabet so as to minimize their average length. The case of a stationary and memoryless block-to-variable-length source coding is discussed.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
