Cryptographic data compressing encoder for e.g. e-mail messages

摘要

The encoder uses a search tree; when each partner receives a message the search tree, or graph, they hold is dynamically adapted to the message source. The code is described by markings along the search path. The decoding is carried out by following the path with code markings up to a sheet of the search graph or tree. The search tree and graph are isomorphically held by adapting in the same manner to the actual massage. Preferably the search tree and graph use the process of rotation to root for the dynamic adapting. The message words, not contained in the search tree or graph, are inserted into a node at which the result deficiency of the search has been decided.