LZ algorthims

Use the DeflateStream Class; it provides "methods and properties for compressing and decompressing streams". Look at articles in this web site for sample uses of the DeflateStream Class. It "uses a combination of the LZ77 algorithm and Huffman coding".

Thank you for your replay. 

I have attached the source code which i thought i did before but i did not aware that my code had not been upload.  Please find the code attached. 

I have used DeflateStream to decompress files in a zip file. I assume they had been compressed using the LZ algorithm. If so then the Microsoft documentation is not clear, but it works for me. I searched the articles in this web site for DeflateStream and got a few results, most or all saying that they are about zip files. So if Nony can use DeflateStream then there is a good chance that either an article in this web site or I can help but I just want Nony to listen a bit more.

The problem might be the way that the binary output is used but I wanted to understand why the bit text cannot first be converted to binary. I agree that it is usually best to assist someone to do things their way instead of expecting them to do things our way but I mainly wanted to ensure that Nony understands the advantages of doing the conversion from text to binary.

Also as you, Vulpes, say we don't see the source code. I think Nony is not putting much effort into this.

Vulpes, there are a few articles in this web site showing use of DeflateStream, which uses the LZ algorithm.

Although you said in your first post that you'd attached the code, I can't see the link.

However, I'd check your implementation against this one (http://www.codeproject.com/KB/recipes/VB_LZW.aspx) which seems to work OK. It's in VB.Net rather than C# but shouldn't be difficult to translate.

The algorithm that i provide it not correct so that i get 100010000000000100--------->{1,0,001,0000,0000001,00} . Therefore, i need your advice to modify my algorithm to get the this result S = 010110011 ------------------------>substrings {0, 1, 01, 10, 011}

Thank you for your assistant.  

Why can't you convert the bits (represented using text) to binary? You could still compress after that. Obviously the compressed data can be binary data since compressed data is binary.

Thanks for your respond.

The only problem that i have is on the outcome. The result of my algorthim is not correct  100010000000000100--------->{1,0,001,0000,0000001,00} 
  001001110010010000--------->{0,01,0011,10010,01000,0} . I need your advice on how  can i change my code to get the correct LZ algorthim examples.   
the correct LZ examples
S = 010110011 ------------------------>substrings {0, 1, 01, 10, 011}, 
S= 001001------------------------------->substring {0,01,001}

Oh, okay. So what is the question? I don't see a question. Note that if you have binary data represented using text then one way to compress it is to convert it from text to binary.