On the calculation of linear programming bound for error correction codes

Abstract

The bound of linear programming for error correcting codes is not a formula bu a result of a computational procedure difficult to perform even on powerful computers. In this paper a program for calculation the bound for given parameters of the code is described. The program comprises two independent parts, which can be ised separately also. The first of them calculates the values of the Krawtchouk polynomials for given parameters and builds the linear programming problem. The other implements a rational simplex-method for solving that problem. Both of them use rational arithmetic with preliminary defined precision.