Algoritmo de Huffman en c#

See more:

C#

I need to know how to compress (read) a file using Huffman Algorithm in c #, because I can do it bit by bit, but I need it to be 1024 bit. Note: sorry for my English.

This is part of my code:

static String BitArrayToStr(BitArray ba)
        {
            byte[] strArr = new byte[ba.Length / 8];

            System.Text.ASCIIEncoding encoding = new System.Text.ASCIIEncoding();

            for (int i = 0; i < ba.Length / 8; i++)
            {
                for (int index = i * 8, m = 1; index < i * 8 + 8; index++, m *= 2)
                {
                    strArr[i] += ba.Get(index) ? (byte)m : (byte)0;
                }
            }

            return encoding.GetString(strArr);
        }