An application of the Hopfield model to Huffman codes

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.<
>