i get a problem how to face this in bitxor?

II=[14 23;16 15];
R=II(:)';
x=0.3;
p=0.343;
for n=2:4;
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
A=sort(x);
[A,T]=sort(x);
Y=R(T);
r = 3.8;
L(1)= 0.234;
for i=2:4
   L(i) = r*L(i-1)*(1-L(i-1));
end
mm=min(L);
nn=max(L);
oo=nn-mm;
Z=uint8(10*((L-mm)/oo))+1;
%CC(1)=bitxor(mod(11,256),mod((Y(1)+Z(1)),256));
for i=2:4
 CC(1)=bitxor(mod(11,256),mod((Y(1)+Z(1)),256));
CC(i)=bitxor(mod(CC(i-1),256),mod(Y(i)+Z(i),256));
end 
ZZ=reshape(CC,[2,2]);

how to get again "Y" from "CC"?

[Walter Roberson]

It is not obvious why you overwrite CC(1) each time through the loop ?