  Binary linear codes with good parameters have important applications in
secret sharing schemes, authentication codes, association schemes, and consumer
electronics and communications. In this paper, we construct several classes of
binary linear codes from vectorial Boolean functions and determine their
parameters, by further studying a generic construction developed by Ding
\emph{et al.} recently. First, by employing perfect nonlinear functions and
almost bent functions, we obtain several classes of six-weight linear codes
which contains the all-one codeword. Second, we investigate a subcode of any
linear code mentioned above and consider its parameters. When the vectorial
Boolean function is a perfect nonlinear function or a Gold function in odd
dimension, we can completely determine the weight distribution of this subcode.
Besides, our linear codes have larger dimensions than the ones by Ding et al.'s
generic construction.
