A New Data Structure for Cumulative Probability Tables: An Improved Frequency‐to‐Symbol Algorithm

A recent paper presented a new efficient data structure, the ‘binary endexed tree’, for maintaining the cumulative frequencies for arithmetic data compression. Although algorithms were presented for all of the necessary operations, significant problems remained with the method for determining the symbol corresponging to a known frequemcy. This communication corrects that deficiency.