Three classes of binary linear codes with good parameters

Three classes of linear codes with good parameters are constructed in this paper. The length, dimension and minimum distance for each class of linear codes are also investigated by means of the well-known Kloosterman sums over finite fields. It is interesting to note that the constructed three classes of linear codes possess good parameters and some of them are shown to be optimal.