diff -urN ibm-aix/MINDIST/src/AWGN.C linux/MINDIST/src/AWGN.C
--- ibm-aix/MINDIST/src/AWGN.C	2003-09-10 10:22:44.000000000 -0400
+++ linux/MINDIST/src/AWGN.C	2005-05-09 05:28:11.000000000 -0400
@@ -95,11 +95,11 @@
     count[i] = 0;
   }
 
-  for (i = 0; i < 9; i++) {
+  for (int i = 0; i < 9; i++) {
     moment[i] = 0;
   }
 
-  for (i = 0; i < NOV; i++) {
+  for (int i = 0; i < NOV; i++) {
     value = (*awgn).nextValue();
     index = (int)(value*10) + 50;
     if (index < 0) {
@@ -116,11 +116,11 @@
     }
   }
 
-  for (i = 0; i < 100; i++) {
+  for (int i = 0; i < 100; i++) {
     cout << count[i]/(1.0*NOV) << "\n";
   }
 
-  for (i = 0; i < 9; i++) {
+  for (int i = 0; i < 9; i++) {
     cout << moment[i]/(1.0*NOV) << "\n";
   }
 
diff -urN ibm-aix/MINDIST/src/BlaumSpectra.C linux/MINDIST/src/BlaumSpectra.C
--- ibm-aix/MINDIST/src/BlaumSpectra.C	2003-09-12 04:05:26.000000000 -0400
+++ linux/MINDIST/src/BlaumSpectra.C	2005-05-09 05:27:21.000000000 -0400
@@ -17,10 +17,10 @@
   H=new int* [M];
   for(int i=0;i<M;i++)
     H[i]=new int[N];
-  for(i=0;i<M;i++){
+  for(int i=0;i<M;i++){
     for(int j=0;j<N;j++)
       H[i][j]=0;
-    for(j=0;j<m;j++){
+    for(int j=0;j<m;j++){
       if(T[i][j]>=0)
 	H[i][T[i][j]]=1;
     }
@@ -33,7 +33,7 @@
   minWeight=N-K+1;tmpMinWeight=N-K+1;
   (*this).threshWeight=threshWeight; //neglecting weight larger than or equal to 50 codewords
   numCodeWordMinWeight=new int [threshWeight];
-  for(i=0;i<threshWeight;i++) numCodeWordMinWeight[i]=0;
+  for(int i=0;i<threshWeight;i++) numCodeWordMinWeight[i]=0;
   codeWordMinWeight=new int** [threshWeight];
   
   timeCounter=0;
@@ -42,7 +42,7 @@
   /*
   previousTestPattern=new int[N];
   previousOrder=new int[N];
-  for(i=0;i<N;i++) {
+  for(int i=0;i<N;i++) {
     previousTestPattern[i]=0;
     previousOrder[i]=0;
   }
@@ -62,10 +62,10 @@
   delete [] H;
   H=NULL;
 
-  for(i=0;i<threshWeight;i++)
+  for(int i=0;i<threshWeight;i++)
     for(int j=0;j<numCodeWordMinWeight[i];j++)
       delete [] codeWordMinWeight[i][j];
-  for(i=0;i<threshWeight;i++)
+  for(int i=0;i<threshWeight;i++)
     if (numCodeWordMinWeight[i]!=0)
       delete [] codeWordMinWeight[i];
   delete [] codeWordMinWeight;
@@ -83,7 +83,7 @@
   int i, itmp, imed;
   double tmpLLR;
 
-  for(i=0;i<N;i++) codeWordLLR[i]=fabs(codeWordLLR[i]); 
+  for(int i=0;i<N;i++) codeWordLLR[i]=fabs(codeWordLLR[i]); 
   //cout<<"starting deBlaum::codingErasures() ..."<<endl;
   if(speedup==1) 
     itmp=decodingErasures(codeWord, 10, codeWordLLR);   
@@ -103,14 +103,14 @@
   J=new int[N];
   Index=new int[numNull+1];
   index=new int[N];
-  for(i=0;i<M;i++) I[i]=i;
-  for(j=0;j<N;j++) J[j]=j;
+  for(int i=0;i<M;i++) I[i]=i;
+  for(int j=0;j<N;j++) J[j]=j;
   heapSortLeftLow(codeWordLLR, J, N, 0, N-1);
 
   //check whether need calculation
   /******************************************************
   k=0;
-  for(i=0;i<N;i++) {
+  for(int i=0;i<N;i++) {
     if(previousTestPattern[i]!=codeWord[i] || J[i]!=previousOrder[i])
       k=1; break;
   }
@@ -127,7 +127,7 @@
     return(1);
   }
   else {
-    for(i=0;i<N;i++) {
+    for(int i=0;i<N;i++) {
       previousTestPattern[i]=codeWord[i];
       previousOrder[i]=J[i];
     }
@@ -161,9 +161,9 @@
  POINT2:
   //cout<<"the number of thresh="<<thresh<<"   "<<k+thresh<<endl;
   m=0;
-  for(i=0;i<Index[thresh];i++) {
+  for(int i=0;i<Index[thresh];i++) {
     d=-1;
-    for(j=0;j<thresh;j++) 
+    for(int j=0;j<thresh;j++) 
       if(i==Index[j]) {d=1; break;}
     if(d==-1) {
       index[m]=i; m++;
@@ -172,17 +172,17 @@
   if(m!=k) cout<<"Errors in BlaumSpectra::decodingErasures "<<m<<" "<<k+thresh<<" "<<Index[thresh]<<endl;
   //cout<<"----Point 3---"<<m<<" "<<k+numNull<<" "<<Index[numNull]<<endl; 
   t=1;
-  for(i=0;i<thresh;i++) t*=2;
+  for(int i=0;i<thresh;i++) t*=2;
   double *imed=new double[t];
 
   //cout<<"start to tranverse all possibilities..."<<endl;
-  for(i=0;i<N;i++) tmpCodeWord[i]=codeWord[i];
+  for(int i=0;i<N;i++) tmpCodeWord[i]=codeWord[i];
   for(l=0;l<t;l++){//search all permutations
     j=l;
-    for(i=0;i<thresh;i++){
+    for(int i=0;i<thresh;i++){
       tmpCodeWord[J[Index[i]]]=j%2;j/=2;
     }    
-    for(i=m-1;i>=0;i--){
+    for(int i=m-1;i>=0;i--){
       itmp=0;
       for(j=index[i]+1;j<N;j++)
 	itmp+=H[I[i]][J[j]]*tmpCodeWord[J[j]];
@@ -205,21 +205,21 @@
 	else if(numCodeWordMinWeight[k]==0) {
 	  numCodeWordMinWeight[k]++;
 	  codeWordMinWeight[k]=new int *[numCodeWordMinWeight[k]];
-	  for(i=0;i<numCodeWordMinWeight[k];i++)
+	  for(int i=0;i<numCodeWordMinWeight[k];i++)
 	    codeWordMinWeight[k][i]=new int [k];
-	  for(i=0;i<k;i++) 
+	  for(int i=0;i<k;i++) 
 	    codeWordMinWeight[k][0][i]=errorPos[i];
 	}
 	else {
 	  tmpCWMinWeight=new int *[numCodeWordMinWeight[k]+1];
-	  for(i=0;i<numCodeWordMinWeight[k]+1;i++)
+	  for(int i=0;i<numCodeWordMinWeight[k]+1;i++)
 	    tmpCWMinWeight[i]=new int[k];
-	  for(i=0;i<numCodeWordMinWeight[k];i++)
-	    for(j=0;j<k;j++)
+	  for(int i=0;i<numCodeWordMinWeight[k];i++)
+	    for(int j=0;j<k;j++)
 	      tmpCWMinWeight[i][j]=codeWordMinWeight[k][i][j]; //preserve the old ones
-	  for(j=0;j<k;j++)
+	  for(int j=0;j<k;j++)
 	    tmpCWMinWeight[numCodeWordMinWeight[k]][j]=errorPos[j]; //add new one
-	  for(i=0;i<numCodeWordMinWeight[k];i++)
+	  for(int i=0;i<numCodeWordMinWeight[k];i++)
 	    delete [] codeWordMinWeight[k][i];
 	  delete [] codeWordMinWeight[k];
 	  codeWordMinWeight[k]=tmpCWMinWeight;
@@ -246,7 +246,7 @@
 int BlaumSpectra::cntHammDist() {
   int i, j, k;
   k=0;
-  for(i=0;i<N;i++) {
+  for(int i=0;i<N;i++) {
     if(tmpCodeWord[i]!=0) { //because the transmitted codeword is all-zero
       errorPos[k]=i;
       k++;
@@ -258,9 +258,9 @@
 int BlaumSpectra::compare(int kk) {
   int i, j, k, l;
   l=1; // default
-  for(i=0;i<numCodeWordMinWeight[kk];i++) {
+  for(int i=0;i<numCodeWordMinWeight[kk];i++) {
     k=0;
-    for(j=0;j<kk;j++) {
+    for(int j=0;j<kk;j++) {
       if(codeWordMinWeight[kk][i][j]!=errorPos[j]) {
 	k=1; break;
       }
@@ -289,7 +289,7 @@
   //strcat(outNameCW, ".spect");
   out.open(outNameSpect, ios::out);
   out.setf(ios::scientific);
-  for(i=1;i<threshWeight;i++) 
+  for(int i=1;i<threshWeight;i++) 
     out<<numCodeWordMinWeight[i]<<"  ";
   out<<endl;
   out.close();
diff -urN ibm-aix/MINDIST/src/FactorGraph.C linux/MINDIST/src/FactorGraph.C
--- ibm-aix/MINDIST/src/FactorGraph.C	2003-09-11 04:24:47.000000000 -0400
+++ linux/MINDIST/src/FactorGraph.C	2005-05-09 05:24:57.000000000 -0400
@@ -21,14 +21,14 @@
   char nodeName[20];
   
   probabilities = new double*[K];
-  for (i = 0; i < K; i++) {
+  for (int i = 0; i < K; i++) {
     probabilities[i] = new double[2];
   }
 
   getOnesInColsOfH(onesInH);
 
   codeBits = new VariableNode*[N];
-  for (i = 0; i < N; i++) {
+  for (int i = 0; i < N; i++) {
     sprintf(nodeName, "CodeBit_%d", i);
     codeBits[i] = new VariableNode(nodeName, i + id, onesInH[i] + 1, // onesInH[i] + 2, if extended graph is used!!
 				   2);
@@ -37,20 +37,20 @@
 
   delete [] onesInH;
   onesInH = new int[M];
-  for (i = 0; i < M; i++) {
+  for (int i = 0; i < M; i++) {
     onesInH[i] = 0;
   }
   getOnesInRowsOfH(onesInH);
 
   parityChecks = new ParityCheckNode*[M];
-  for (i = 0; i < M; i++) {
+  for (int i = 0; i < M; i++) {
     sprintf(nodeName, "ParityCheck_%d", i);
     parityChecks[i] = new ParityCheckNode(nodeName, i + id, onesInH[i]);
   }
   id += M;  
 
   channelTransitions = new ChannelTransition*[N];
-  for (i = 0; i < N; i++) {
+  for (int i = 0; i < N; i++) {
     sprintf(nodeName, "ChannelTransition_%d", i);
     channelTransitions[i] = new ChannelTransition(nodeName, i + id);
   }
@@ -64,10 +64,10 @@
   int portF;
 
   portV = new int[N];
-  for (i = 0; i < N; i++) {
+  for (int i = 0; i < N; i++) {
     portV[i] = 1;
   }
-  for (i = 0; i < M; i++) {
+  for (int i = 0; i < M; i++) {
     // all parity check nodes
     portF = 0;
     for (int j = 0; j < m; j++) {
@@ -81,7 +81,7 @@
     }
   }
   delete [] portV;
-  for (i = 0; i < N; i++) {
+  for (int i = 0; i < N; i++) {
     // all channel transition nodes
     Node::connect(channelTransitions[i], codeBits[i], 0, 0, 2);
   }
@@ -98,31 +98,31 @@
       }
     }
   }
-  for (i = 0; i < N; i++) {
+  for (int i = 0; i < N; i++) {
     Node::disconnect(channelTransitions[i], codeBits[i]);
   }
-  for (i = 0; i < N; i++) {
+  for (int i = 0; i < N; i++) {
     delete codeBits[i];
     codeBits[i] = NULL;
   }
   delete [] codeBits;
   codeBits = NULL;
 
-  for (i = 0; i < N; i++) {
+  for (int i = 0; i < N; i++) {
     delete channelTransitions[i];
     channelTransitions[i] = NULL;
   }
   delete []channelTransitions;
   channelTransitions = NULL;
 
-  for (i = 0; i < M; i++) {
+  for (int i = 0; i < M; i++) {
     delete parityChecks[i];
     parityChecks[i] = NULL;
   }
   delete []parityChecks;
   parityChecks = NULL;
 
-  for (i = 0; i < K; i++) {
+  for (int i = 0; i < K; i++) {
     delete[] probabilities[i];
     probabilities[i] = NULL;
   }
@@ -162,7 +162,7 @@
   }
 
   // update all nodes that have to be updated only once before all iterations are going to be made
-  for (i = 0; i < N; i++) {
+  for (int i = 0; i < N; i++) {
     (*codeBits[i]).update(0);
   }
 }
@@ -175,7 +175,7 @@
   for (int i = 0; i < N; i++) {
     (*codeBits[i]).updateAll();
   }
-  for (i = 0; i < M; i++) {
+  for (int i = 0; i < M; i++) {
     (*parityChecks[i]).updateAll();
   }
 }
@@ -185,7 +185,7 @@
     if(i!=k)
       (*codeBits[i]).updateAll();
   }
-  for (i = 0; i < M; i++) {
+  for (int i = 0; i < M; i++) {
     (*parityChecks[i]).updateAll();
   }
 }
@@ -194,7 +194,7 @@
     if(i!=k && i!=j)
       (*codeBits[i]).updateAll();
   }
-  for (i = 0; i < M; i++) {
+  for (int i = 0; i < M; i++) {
     (*parityChecks[i]).updateAll();
   }
 }
@@ -203,10 +203,10 @@
   for (int i = 0; i < N; i++) {
     (*codeBits[i]).reset();
   }
-  for (i = 0; i < M; i++) {
+  for (int i = 0; i < M; i++) {
     (*parityChecks[i]).reset();
   }
-  for (i = 0; i < N; i++) {
+  for (int i = 0; i < N; i++) {
     (*channelTransitions[i]).reset();
   }  
 }
diff -urN ibm-aix/MINDIST/src/FunctionNode.C linux/MINDIST/src/FunctionNode.C
--- ibm-aix/MINDIST/src/FunctionNode.C	2003-09-10 10:22:47.000000000 -0400
+++ linux/MINDIST/src/FunctionNode.C	2005-05-09 05:22:29.000000000 -0400
@@ -28,10 +28,10 @@
   
   //normalization of message values
   sum=0.0;
-  for (i = 0; i < (*(VariableNode*)neighbours[port]).getSize(); i++) {
+  for (int i = 0; i < (*(VariableNode*)neighbours[port]).getSize(); i++) {
     sum +=outMessages[port][i];
   }
-  for (i = 0; i < (*(VariableNode*)neighbours[port]).getSize(); i++) {
+  for (int i = 0; i < (*(VariableNode*)neighbours[port]).getSize(); i++) {
     if (sum > EPS) {
       outMessages[port][i] /=sum;
     } else {
Binary files ibm-aix/MINDIST/src/Main and linux/MINDIST/src/Main differ
diff -urN ibm-aix/MINDIST/src/Makefile linux/MINDIST/src/Makefile
--- ibm-aix/MINDIST/src/Makefile	2003-09-10 10:25:47.000000000 -0400
+++ linux/MINDIST/src/Makefile	2005-05-09 06:10:00.000000000 -0400
@@ -1,19 +1,21 @@
 # My compiler:
-CC = xlC
+CC = g++
 
 # Virtual path for include files:
 #VPATH = ../include
 
 # Libraries:
-LIB = -lcomplex -L/zurich/usr/matlab4/curr/extern/lib/ibm_rs -lm
+#LIB = -lcomplex -L/zurich/usr/matlab4/curr/extern/lib/ibm_rs -lm
+#LIB = -lcomplex -lm
+LIB = -lm
 
 # Compiler flags:
 # ---------------
 # Normal setting:
-#CCFLAGS = -I../include
+CFLAGS = -I../include -Wno-deprecated
 #
 # For debugging (Note that -g disables inlining):
-CCFLAGS = -I../include -g -qinfo=nocnv:notrd -qcheck -bloadmap -bnoquiet
+#CCFLAGS = -I../include -g -qinfo=nocnv:notrd -qcheck -bloadmap -bnoquiet
 
 #
 # For optimization:
@@ -35,7 +37,8 @@
 #mytest.o:    mytest.C iofnct.h random.h codes.h spadet.h ldpc.h
 
 Main: Main.o $(OBJ)
-	$(CC) $(CFLAGS) -o Main $(OBJ) $(LIB) -bmaxdata:0x80000000
+	$(CC) $(CFLAGS) -o Main $(OBJ) $(LIB) 
+#-bmaxdata:0x80000000
 
 
 
@@ -86,9 +89,8 @@
 #---------------
 clean:     clean_objects
 
-clean_objects:     `rm *.o`
-
-
+clean_objects:     
+	@rm -f *.o
 
 
 
diff -urN ibm-aix/MINDIST/src/Node.C linux/MINDIST/src/Node.C
--- ibm-aix/MINDIST/src/Node.C	2003-09-10 10:22:48.000000000 -0400
+++ linux/MINDIST/src/Node.C	2005-05-09 05:22:02.000000000 -0400
@@ -48,7 +48,7 @@
     (*node1).outMessages[port1][i] = 0.0;   //1.0/alphabetSize;
   }
   (*node2).outMessages[port2] = new double[alphabetSize];
-  for (i = 0; i < alphabetSize; i++) {
+  for (int i = 0; i < alphabetSize; i++) {
     (*node2).outMessages[port2][i] = 0.0;   //1.0/alphabetSize;
   }
 }
@@ -63,7 +63,7 @@
       break;
     }
   }
-  for (i = 0; i < (*node2).numNeighbours; i++) {
+  for (int i = 0; i < (*node2).numNeighbours; i++) {
     if ((*node2).neighbours[i] == node1) {
       index2 = i;
       break;
diff -urN ibm-aix/MINDIST/src/ParityCheckNode.C linux/MINDIST/src/ParityCheckNode.C
--- ibm-aix/MINDIST/src/ParityCheckNode.C	2003-09-10 10:28:39.000000000 -0400
+++ linux/MINDIST/src/ParityCheckNode.C	2005-05-09 05:23:10.000000000 -0400
@@ -75,12 +75,12 @@
   }
   //backward in the internal factor graph
   backwardMessage[numNeighbours-1]=((*(VariableNode*)neighbours[numNeighbours-1]).getOutMessage(portNumbers[numNeighbours-1]))[0];
-  for (i = numNeighbours-2; i >= 0; i--){
+  for (int i = numNeighbours-2; i >= 0; i--){
     backwardMessage[i]=LogModPlus(backwardMessage[i+1], ((*(VariableNode*)neighbours[i]).getOutMessage(portNumbers[i]))[0]);
   }
   //update the messages to the neighbours of this parity check node
   outMessages[0][0] = backwardMessage[1];
-  for (i = 1; i < numNeighbours-1; i++){
+  for (int i = 1; i < numNeighbours-1; i++){
     outMessages[i][0]=LogModPlus(forwardMessage[i-1], backwardMessage[i+1]);
   } 
   outMessages[numNeighbours-1][0] = forwardMessage[numNeighbours-2];