On generating independent random strings

Details On generating independent random strings On generating independent random strings

2009-03-23

arxiv.org/abs/0903.3889v1

Computer Science

Information Theory

CiE 2009, Heidelberg

Scientific paper

It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strings that are random and pairwise independent. If the two initial strings are random, then the above task can be performed in polynomial time. It is also possible to construct in polynomial time a random string, from two strings that have constant randomness rate.

Affiliated with

Also associated with

No associations

Rating

On generating independent random strings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On generating independent random strings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On generating independent random strings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-347051