Compaction Algorithm

Completed Posted Apr 17, 2011 Paid on delivery

$20-25 USD

Paid on delivery

Completed Paid on delivery

Version:1.0 StartHTML:0000000167 EndHTML:0000005533 StartFragment:0000000457 EndFragment:000000551

Read the file bit by [url removed, login to view] example we have a bit sequence like this.

1111110000000011111

If we have even number of bits group

We have six 1 bits. Our algorithm reduces the even number of bits to half.

111111>111 0000>00

If we have odd number of bits group

Add a new same bit to the and. Reduce the bit number to the half. Change penultimate bit to the opposite one.

11111>111111>111>101 1>01 0>10. There is two exception. 000>110 111>001

We create a huffman tree with results.

111111 000 1111 0000 111111>111 10 11 00 111. 111, 10, 11 and 00 create huffman tree's nodes. Unziping is opposite of the algorithm.

Engineering Project Management Software Architecture Software Testing

Project ID: #3251514

About the project

2 proposals Remote project Active Apr 20, 2011

Looking to make some money?

Benefits of bidding on Freelancer

Set your budget and timeframe
Get paid for your work
Outline your proposal
It's free to sign up and bid on jobs

Awarded to:

mikibgd's Profile Picture
mikibgd

See private message.

$21.25 USD in 2 days
(6 Reviews)
2.2

2 freelancers are bidding on average $19 for this job

topmaxvw's Profile Picture
topmaxvw

See private message.

$17 USD in 2 days
(3 Reviews)
2.9
Post a project like this