Python Expert in Data Compression (LZ77 + Adaptive arithmetic )

Task in Data Compression:

1. With the help of your program, you should make the follow exercise:
Take your I.D. number (ignore zero in the beginning) and create follow sentence:
1*(I.D.) 2*(I.D) … 9*(I.D.)
For example, if I.D. number n = 3246266704
2*n = 6492533408; 3*n = 9738800112; … 9*n = 29216400336;
The sentence will be:
324626670464925334089738800112…29216400336
Repeat this sentence 1000 times.


2. Code this text with the help of LZ77, which is sending only two numbers: the offset and the word size.
Select search and lookahead buffer with the same size.
Use: Adaptive arithmetic coding.


I need to see in project results:

a) Initial sentence;
b) Results of the LZ77 in the <X,Y> format,
c) Encoded sentence (bits written as text);
d) Resulting bit code in the binary file.
e) code of program
f) word file with a short explanation report (including the explanation of your LZ77 version algorithm).

Note: If a part of your code was taken from some external source, it should be referenced in the report.

Deadline: 30/06/23