I know that Huffman is not a encryption method, but I have a bit-stream that I know it's Huffman coded. However, the tree/table that maps the codes to real characters is not available. Surprisingly, during my searches I couldn't find helpful sources or even academic papers on this problem. It seems this problem has no literature.
Can anyone introduce a helpful resource on this? Is there any algorithm that I can devise or adapt to solve this problem?
P.S. Actually I know that the bit-stream is a JPEG file which is Huffman coded.
Thank you in advance