The answer to the question: Is there a Lossless Data compression method/algorithm that is independent of repetitive pattern (redundancy)?

Is: Yes

The probability of each symbol is used, the order of the symbol is not. Also know as an Order-0 Markov chain, are used to encode data to reduces the number of bits for frequently used symbols, and more bits for infrequently used symbols.

Some Forms of entropy encoding: Huffman coding, Arithmetic coding , and the Recent Asymmetric Numeral Systems.

No Patterns have to repeat in order to apply entropy compression.

In fact, given the same data in another file in any random order will produce a compressed file of exactly the same size (if only the entropy encoding is used). Each being able to be decoded back to their respective source.

Entropy encoding is often used as the last step of compression (IE: Hoffman / Arithmetic / aRNS )

I suggest doing an internet search:

Entropy encoding

Entropy shannon

The answer to the question: Is there a Lossless Data compression method/algorithm that is independent of repetitive pattern (redundancy)?

Is: Yes

The probability of each symbol is used, the order of the symbol is not. Also know as an Order-0 Markov chain, are used to encode data to reduces the number of bits for frequently used symbols, and more bits for infrequently used symbols.

Some Forms of entropy encoding: Huffman coding, Arithmetic coding , and the Recent Asymmetric Numeral Systems.

No Patterns have to repeat in order to apply entropy compression.

In fact, given the same data in another file in any random order will produce a compressed file of exactly the same size (if only the entropy encoding is used). Each being able to be decoded back to their respective source.

Entropy encoding is often used as the last step of compression (IE: Hoffman / Arithmetic / rANS or tANS )

I suggest doing an internet search:

Entropy encoding

Entropy shannon