compression - How would I go about implementing this algorithm? -

Some time ago I was trying to brush a remote control that was sent 12-bit binary 'key'.

The tool I created, but was very slow because it was trying about every combination of 50 bits per second (4096 code = 49152 bit = ~ 16 minutes)

I opened the receiver and found that there was no need for a delay between the efforts by using a change register to check these codes. This meant that the receiver was only looking for the last 12 bits to see if they were match for the key.

It meant that if the stream was sent 111111111111000000000000 , it effectively had tried all these codes.

<1111111111111111111111111111111111001111111111000111111110000111111100000111111000000 111110000000 111100000000 1110000000000 110000000000 1000000000000 100000000000000000000000000 In this case, I know the algorithms that have been taken by taking advantage of this Can I reduce my 49152 bits?

What you are talking about is one if you do not care about it How it works, you just want results.