An application of the Hopfield model to Huffman codes
type: Item
instance of: scholarly article
title: An application of the Hopfield model to Huffman codes
zbMATH Open document ID: 0783.94010
DOI: 10.1109/18.256519
author: Francesco Fabris
author: Giacomo Della Riccia
published in: IEEE Transactions on Information Theory
publication date: 1994-03-13T00:00:00Z
Mathematics Subject Classification ID: 94A45
Mathematics Subject Classification ID: 94A29
Mathematics Subject Classification ID: 92B20
zbMATH DE Number: 495165
zbMATH Keywords: source coding
zbMATH Keywords: Huffman codes
zbMATH Keywords: adaptive coding
zbMATH Keywords: parallel computation
zbMATH Keywords: neural network
zbMATH Keywords: Hopfield model
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1109/18.256519
OpenAlex ID: W2133968274
Recommended article: On the competitive optimality of Huffman codes
Recommended article: A note on the competitive optimality of the Huffman code
Recommended article: Design and analysis of dynamic Huffman codes
Recommended article: Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code
Recommended article: On the redundancy of binary Huffman codes (Corresp.)
Recommended article: On the redundancy achieved by Huffman codes
Recommended article: A Dynamic Programming Approach to Length-Limited Huffman Coding: Space Reduction With the Monge Property
Recommended article: A fast algorithm for optimal length-limited Huffman codes
description: scientific article; zbMATH DE number 495165