AbstractHuffman coding is known for its ability to generate minimumredundancy codes given a set of nonnegative weights. Associative memory is one of the most widely used tools in parallel processing because of its capability of parallel search and comparisons. In this paper we develop a pair of implementations for static and dynamic Huffman coding based on a sequential representation using associative memory. The efficiency of the proposed implementations is evaluated and the simulation results are presented.