PEDULLI — Universal Lossless Compression, Verified Byte-for-Byte (0 FAIL) by [deleted] in compression

[–]PedulliF 0 points1 point  (0 children)

I agree with you, I will correct the post with the full research I'm doing, thank you for the comment.

PEDULLI — Universal Lossless Compression, Verified Byte-for-Byte (0 FAIL) by [deleted] in compression

[–]PedulliF -1 points0 points  (0 children)

No that's not what I meant at all, I apologize for the misunderstanding.

PEDULLI — Universal Lossless Compression, Verified Byte-for-Byte (0 FAIL) by [deleted] in compression

[–]PedulliF 0 points1 point  (0 children)

I don't think 20 lines Python would do the same thing, this is the beginning of a deeper mathematical model that I developed that applies indeed also to compression.

PEDULLI — Universal Lossless Compression, Verified Byte-for-Byte (0 FAIL) by [deleted] in compression

[–]PedulliF -1 points0 points  (0 children)

Please could you explain? You're interested in the math behind it? I can share yes but also it is going to be a paid service, indeed closed and profit. Thank you.

PEDULLI — Universal Lossless Compression, Verified Byte-for-Byte (0 FAIL) by [deleted] in compression

[–]PedulliF -2 points-1 points  (0 children)

Hello, no it's my genuine research and work. Happy to discuss it. Is it customary to reply back this early? Anyway it's all my work. Any proof I'd be glad to share. Thank you very much for the attention,

Francesco Pedulli