In section 4 we assume that the constraints for both window and repetition length were removed,

In order to create a prefix free code we theoretically need to represent each repetition in a fixed length, meaning each repetition must be the size of maximal window and repetition (i.e - n-1).

My question is - for a repetition such as [3,3], are we to calculate size according to minimal necessary bit (in this case 1+2+2=5) or always calculate each repetition according to maximal possible length and pad with zeros??

Repetition bit representation for section 4