NOTE: This site is obsolete. See book draft (in PDF):

The Laws of Cryptography with Java Code.

Here is a Java program that will generate the entire table, for any input probability p:

// Table.java: given p, calculate a table for different numbers of duplicates
//   p: the channel probability for a binary symmetric channel
public class Table {

   // main function to do calculation
   public static void main (String[] args) {
      double p = (Double.valueOf(args[0])).doubleValue(); // channel probability
      int[] values = {1, 3, 5, 7, 9, 11, 25, 49, 99, 199};
      System.out.println("<table BORDER NOSAVE >");
      System.out.println("<tr><td align=center><b>Number of</b>");
      System.out.println(" <br><b>Duplicates</b></td>");
      System.out.println(" <td align=center><b>Transmission</b>");
      System.out.println(" <br><b>Rate</b></td>");
      System.out.println(" <td align=center><b>Error</b>");
      System.out.println(" <br><b>Rate</b></td>");
      System.out.println(" <td align=center><b>Success</b>");
      System.out.println(" <br><b>Rate</b></td></tr>");
      for (int len = 0; len < values.length; len++) {
         int n = values[len];
         double result = 0;
         for (long i = n; i > n/2; i--)
            result += comb(n,i)*Math.pow(p,i)*Math.pow(1-p,n-i);
         System.out.println("<tr><td>" + n + "</td><td>" +
             100.0/n + "%</td><td>" + (100.0 - 100.0*result) + "%</td><td>" + 
             100.0*result + "%</td></tr>" );
      }
      System.out.println("</table>");
   } // end of main

   // comb(n, i): the number of combinations of n things taken i at a time
   private static double comb(long n, long i) {
      double result = 1.0;
      if (i < n/2) i = n-i;
      for (long j = n; j > i; j--)
         result *= ((double)j/(j-i));
      return result;
   }
}