Next: Introduction
Nonexistence of Codes
via Linear Programming
Norazura Mohd Nor @ Nordin
Ernest E. Sibert
Harold F. Mattson
A 1994 NPAC REU PROJECT
Abstract:
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 a code is impossible.
Using MacWilliams relations and additional constraints derived from special properties of the correcting codes, linear
programming problems can be formulated. Due to severe rounding errors
implicated by the large coefficients and dimensions of the linear programming,
the study will also investigate the equilibration of the coefficients and the
use of Kahan's summation formula in the simplex algorithm to extend accuracy
beyond double precision.