Nonexistence of Codes via Linear Programming

by Norazura Mohd Nor @ Nordin
Advisor : Ernest E. Sibert and Harold F. Mattson

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.

Implementation

The linear programming problem was implemented on CM5 machine using CM-Fortran. The program requires the user to specify m information bits, codewords of n bits and minimum distance d. Various codes of class [n, m+1, d] were tested. As far as efficiency is concern, the program suffers severe rounding error even with Kahan's summation formula. The implementation and the result of the program can be view through this following link.

This next link will take you to my personal biodata.

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