A linear programming estimate of the weight distribution of BCH (255,k)

To estimate the weight distribution of a binary linear code, a linear programming approach has been proposed, which leads to the best known values for BCH (255,k). Following that approach, we propose three methods which give tighter estimates. At the same time, we find the distance of the dual of BCH [255,199,15].