Hello.

I'm new here and sorry if some thing wrong.

I have modification of lossless data compression. It is already publicated from patent organization of my country so i can show how it works. I don't know worth it something or not and now i looking some advice about what to do, or some one to cooperate if it worth some thing. I can't write fully worked program because it needs too many calculations what table or what table combinations use, but i have checked it on many compressed and not compressed different types of files and my method works.

EXAMPLE:

Imagine we have the following sequence of bit signals

10011001000101100110010110011001000100101101001100 0100101100 (initial data)

COMPRESSION:

1) Stage

Represent it as symbols by using the following table:

A _ 000

B _ 001

C _ 010 (Previously made up initial table)

D _ 011

E _ 100

F _ 101

G _ 110

H _ 111

We get the following text:

E G C B D B E F E G C B B D C D A E F E (the set of symbols of the first stage)

Perform text coding using the Huffman Coding method.

We shall obtain the following table:

A _ 1010

B _ 00

C _ 111 (the data restoring of the set of symbols of the first stage)

D _ 110

E _ 01

F _ 100

G _ 1011

We inscribe the text obtained from the original bit signal expressed by the symbols in the form of bit sequence using table obtained by Huffman Coding.

We get the following set of bit signals:

01101111100110000110001101111100001101111101010011 0001 (first stage result)

2) Stage

Imagine the compressed set of bit signals into initial data.

Represent it (like the first stage) in the form of text symbols using the initial previously made table.

We get the following set of symbols:

D D H B E B E D D H A D D H C E G B (the set of symbols of the second stage)

We perform the text coding using the method of Huffman Coding again.

We shall obtain the following table:

A _ 0111

B _ 00

C _ 010

D _ 10 (the data restoring of the set of symbols of the second stage)

E _ 111

G_ 0110

H _ 110

Let write the set of symbols of the second stage as the bit sequence through the data restoring the set of symbols of the second stage received in the result of coding through Huffman Coding method.

We get the following set of bit signals:

10101100011100111101011001111010110010111011000 (second stage result).

Here is shown just 2 stage, this method can have many stages and for better results can be used many different previously made up initial tables, different tables on different stages, different combinations of this tables and different algorithms of lossless data compression.