step 2:
x=0.3;x=0.3;p=0.343;for n=2:65536;if x(n-1)>=0 & x(n-1)<=p x(n)=x(n-1)/p;else x(n)=(1-x(n-1))/(1-p);end end
step 3:
K(n)= mod(floor((x(n)*10^2-floor(x(n)*10^2))*10^3);,256);if K(n)<3 K(n)=K(n)+3;end
step 4. Checking ?(n), if ?(n) < 3, then ?(n) = ?(n) + 3.
Step 5. Let n ← n+ 1, return to Step 3 until n reaches ?.
Best Answer