Patent ID: 6556151
Filing Date: 2003-04-29
Classification: H03M

Abstract:
A method for reducing the number of binary digits in a message, the method comprising the steps of:encoding a message in accordance with a predefined Huffman coding method such that a compressed message is generated, the compressed message having a reduced number of the binary digits; the Huffman coding is performed after the following steps: receiving at least one message comprising a plurality of characters; calculating, for each character, a value indicating a relative frequency of the character in the at least one message; assigning a first binary coded code symbol (H1) to a character having the highest relative frequency, the code symbol comprising a plurality of binary digits; selecting all or substantially all the binary digits in the first binary coded code symbol to a first binary value; assigning a unique symbol to each unique remaining character so as to generate a first encoded message; the first encoded message consisting of a first set of binary digits; wherein the binary digits in each symbol are selected such that the number of binary digits having the first binary value is maximised in the first set of binary digits; encoding the first set of binary digits such that a second set of binary digits is generated; and selecting the binary digits in the second set of binary digits such that the number of binary digits having the first binary value in the second set is higher than the number of binary digits having the first binary value in the first set.