Re^2: How to efficently pack a string of 63 characters


There's more than one way to do things
	PerlMonks

Re^2: How to efficently pack a string of 63 characters

by baxy77bax (Deacon)

on Sep 09, 2021 at 21:05 UTC ( [id://11136617]=note: print w/replies, xml )

Need Help??

in reply to Re: How to efficently pack a string of 63 characters
in thread How to efficently pack a string of 63 characters

To tell the truth i totally forgot about that post. Yes, back then I needed it for something completely different and totally did not connect the two problems. I should have been more aware of what I was posting and not waste time. I do apologize for that :(

When I say random i always assume sampling from a uniform dist. (but yes, more information and rules i have, more compression I am going gain)

Thnx

Comment on Re^2: How to efficently pack a string of 63 characters

Replies are listed 'Best First'.

Re^3: How to efficently pack a string of 63 characters
by LanX (Saint) on Sep 10, 2021 at 13:17 UTC

> When I say random i always assume sampling from a uniform dist.

The shown sample is obviously far from random or uniformly distributed

> > > Example:

ABBCBCAAAAABBCBCACCCAAAAACAAAAABBBBBAAAAABBAAAAAAAABBCCCACCAABC
BCCCBCAACAABBBCAAACCAAAAACAAAAABBBBBAAAAABBAAAAAAAABBCCCACCABBC
ABCCBBBAAAABBABCACABCCCCCCAAAAABBCBBCCCCAAAAAAAAAAAAACCCACCACCC
...
[download]

Please show us some real input. And more of it.

Otherwise, if that's real input, please realize it's very redundant.

Otherwise couldn't compress such a distribution to 5% already.

Cheers Rolf
_{(addicted to the Perl Programming Language :)

Wikisyntax for the Monastery}

[reply]
[d/l]

In Section Seekers of Perl Wisdom