Hi
I have to do lossless compression for two separate programs using Huffman coding and goloumb rice coding with block length you decide as per input of p,so you can take p=(0,1) p=(0,2) p=(0,3) and could be block length 10^6, then you get encoder output as a binary file and put the file in decoder input you will get out put as sequence which we given in input sequence then do for same goloumb rice coding.
Next compare the two methods for varying values of P we have to see how close are they to H(X).
any questions feel free to ask.
--
Hi there.....
Warm Greetings
We came along with your request for DMS Binary Compression Project and we reviewed your project description. We'd like to help you with confidence and satisfying results...
We have professionals working here with 100% results and more creative and renovative ideas for our clients !
We have worked on several similar projects before!
We are offering our services for more than 5 years in the field of Matlab and Mathematica
We have worked on 300+ Projects. Please check the profile reviews
Feel free to message us to discuss briefly about your project !