'
 <img src="jess_long_greenish.gif",
  align = "left">

  <h1> Nonexistence of Codes via Linear Programming </h1>

  <b> by Norazura Mohd Nor @ Nordin  <br>
      Advisor : Ernest E. Sibert and Harold F. Mattson </b> 
<br>
<br>
 
Project conducted as part of the 1994 Research Experiences for Undergraduates (REU) Program in High-Performance Computing conducted by Northeast Parallel Architecture Center (NPAC) at Syracuse University. <br>
<hr>  


<h2> Abstract </h2>

A study is proposed to investigate existence of certain error correcting codes through linear programming. If the result obtained from the linear programming are feasible such a code may exist, if not such code is impossible. The linear programming is formulated using
Macwilliams relations and additional constraints derived from special property of the correcting codes. Kahan's summation formula is applied 
in the simplex algorithm to extend accuracy beyond double precision. <br>
<hr>

<h2> Introduction </h2>
   The intent of this project is to implement algorithm that can correctly and efficiently verify the existence of the certain correcting codes of the class [n,m+1,d]. The task is to develop reliable algorithm that can proof the existence of certain codewords of n bits given m of information bits and mimimum distance d. <br>
<hr>

<A href ="homepage2.html"> <img src = "jess_s_grey.gif"> </A>
<br>
<i> next page </i>
<hr>

<i> Norazura Mohd Nor @ Nordin <br>
     Computer Science department, <br>
     Syracuse University, Syracsue <br>
     e-mail: nmnordin@mailbox.syr.edu <br>
</i>
<br>
<br>

<img src= "bre_s_oil.gif", align ="left">
 <img src="bre_s_oilchoc.gif", align="right">
 <img src ="bre_s_oilred.gif", align="right">
  <img src= "bre_s_edge.gif", align ="right">
<img src= "bre_s_oil.gif", align ="right">
 <img src="bre_s_oilchoc.gif", align="right">
 <img src ="bre_s_oilred.gif", align="right">
<img src= "bre_s_edge.gif", align ="right">
<br>
<hr>