Browse Prior Art Database

DYNAMIC OPTIMUM DATA COMPRESSION FOR REMOTE INTERACTIVE COMMUNICATION TRANSMISSIONS

IP.com Disclosure Number: IPCOM000027077D
Original Publication Date: 1995-Feb-28
Included in the Prior Art Database: 2004-Apr-07

Publishing Venue

Xerox Disclosure Journal

Abstract

For large transmissions, information is divided along byte boundaries. The occurrence of each byte is counted and stored in a table. Usin the table, which generated. All 256 possible bytes are given a variable bit-length code which provides for maximum data compression. The large transmission contains initially the table, wherein the rest of the transmission is Huffman encoded information. The remote has software which contains the same algorithm to construct the Huffman Trees, and by doing so with the transmitted table, decodes the information into its original bytes,