Abstract:
A recent paper presented a new efficient data structure, the “Binary Indexed Tree”, for maintaining the cumulative frequencies for arithmetic data compression. While algorithms were presented for all of the necessary operations, significant problems remained with the method for determining the symbol corresponding to a known frequency. This report corrects that deficiency.