JT file format : Building huffman tree

I am trying to read a JT File. JT file may have information which is compressed by using Huffman Algorithm. I am facing a problem while building the Huffman tree. There's an ambiguity in the implementation which occurs when two symbols have the same frequency, depending on the comparison that we use between the nodes, the order may be different and leads to an inversion of some branches of the tree. So I am unable to build proper Huffman tree. Have anyone faced this issue earlier? Is there any so开发者_如何转开发lution for this?

I have faced the same issue when I tried to implement a parser for JT. Didn't get a solution. I also tried to contact some guys from Siemens but without getting a solution. There IS an ambiguity which can't be solved without further information from Siemens. The Spec alone doesn't help. But I think Huffman is dropped out in the newest JT Spec.