A New Data sturcture for cumulative Probability Tables: an Improved Frequency to Symbol Algorithm

Fenwick, P.

dc.contributor.author	Fenwick, P.	en
dc.date.accessioned	2009-04-08T04:02:59Z	en
dc.date.available	2009-04-08T04:02:59Z	en
dc.date.issued	1995-03	en
dc.identifier.citation	Computer Science Technical Reports 110 (1995)	en
dc.identifier.issn	1173-3500	en
dc.identifier.uri	http://hdl.handle.net/2292/3474	en
dc.description.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.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	Computer Science Technical Reports	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/csTRcgi.pl?serial	en
dc.title	A New Data sturcture for cumulative Probability Tables: an Improved Frequency to Symbol Algorithm	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en