/**

@page references References

@anchor apiki
  <b>Apiki, Steve.</b>,<br>
  Lossless data compression: two algorithms - Huffman coding and LZW coding - are at the root of most compression.<br>
  Byte, 1991 Mar; 16, n3309(7).

@anchor bell
  <b>Bell, Timothy C, Cleary, John G, and Witten, I. H.</b>,<br>
  Text compression.<br>
  Prentice Hall Advanced Reference Series. Englewood Cliffs, N.J: Prentice Hall, 1990.

@anchor beveridge
  <b>Beveridge, J.</b>,<br>
  Self-Registering Objects in C++.<br>
  Dr. Dobb's Journal 288: 38-41, 1998.

@anchor gamma
  <b>Gamma, E., Helm, R., Johnson, R., and Vlissides, J.</b>,<br>
  Design Patterns: Elements of Reusable Object-Oriented Software.<br>
  Reading, MA: Addison-Wesley, 1995.

@anchor moffat
  <b>Moffat, A., Neal, R. M., and Witten, I. H.</b>,<br>
  Arithmetic Coding Revisited.<br>
  ACM Transactions on Information Systems, 16(3): 256-94, 1998.

@anchor nelson
  <b>Nelson, Mark.</b>,<br>
  Priority Queues and the STL.<br>
  Dr. Dobb's Journal 1996(1).

@anchor shannon
  <b>Shannon, C.</b>,<br>
  The mathematical theory of communications.<br>
  Bell System Technical Journal, Vol. 27, pp. 379-423 and 623-565, 1948.

@anchor witten
  <b>Witten, Ian H. Author, Moffat, Alistair Author, Bell, Timothy Author, and Fox, Ed.</b>,<br>
  Managing Gigabytes: Compressing and Indexing Documents and Images.<br>
  Morgan Kaufmann, May 1999.

&nbsp;

*/
