An application of the Hopfield model to Huffman codes

DOI10.1109/18.256519MaRDI QIDQ4277173zbMATH OpenOpenAlexFDO

Authors Francesco Fabris, Giacomo Della Riccia

Publication date 13 March 1994

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.256519

zbMATH Keywords

adaptive codingHopfield modelHuffman codesneural networkparallel computationsource coding

Mathematics Subject Classification ID

Neural networks for/in biological studies, artificial life and related topics (92B20) Source coding (94A29) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• On the competitive optimality of Huffman codes
• A note on the competitive optimality of the Huffman code
• Design and analysis of dynamic Huffman codes
• Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code
• On the redundancy of binary Huffman codes (Corresp.)
• On the redundancy achieved by Huffman codes
• A Dynamic Programming Approach to Length-Limited Huffman Coding: Space Reduction With the Monge Property
• A fast algorithm for optimal length-limited Huffman codes

Cited in

(5)

• A higher order Hopfield network for vector quantisation
• scientific article; zbMATH DE number 597653 (Why is no real title available?)
• Transform image coding by feedforward neural networks
• Neural networks, error-correcting codes, and polynomials over the binary n-cube
• scientific article; zbMATH DE number 853066 (Why is no real title available?)

This page was built for publication: An application of the Hopfield model to Huffman codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277173)