LOW COMPLEXITY COMPRESSION OF SHORT MESSAGES

摘要

The present invention relates to a method for data communication, where the data compression and decompression is performed by use of a specific hash table, by which data compression a symbol for each data segment is generated, which symbols are transmitted to the receiver, in which receiver the symbols are decompressed by use of the specific hash table. It is the object of the invention to perform reliably and fast data transmission between communication devices by data compression. A further object of the inventions is to perform a secure communication between computerized devices. The object can be fulfilled by the preamble to claim one if modified in a way where the specific hash table is performed as a hash table array, which hash table array generates symbols comprising at least a hash count and a parity check, in which hash table array the parity check comprises generating of a data string, which data string is compared with a parity stored in the hash table, where if both parities are the same, the data model returns the count in the hash table element for transmission, where a zero count is returned indicating that the data string is not valid in the hash table an no transmission is performed. Hereby it can be achieved that the count in the hash table is controlled in that the count is not accepted until the parity check is accepted. After the symbol has been transmitted to a receiver it is very important that the symbol is correctly received. Therefore the parity check is performed once again after the symbol has been received to ensure that after the symbol has been received.