We examine the p-ary linear codes from incidence matrix of the Bouwer graph B(N, m, 3) with vertex set Z(m) xZ(3) x Z(3) x ... xZ(3) /| {z} N-1times and two vertices are adjacent if they can be written as (a, b) and (a+ 1, c), where either c = b or c = (c(1), c(2), ... , c(N-1)) differs from b = (b(1), b(2), ... , b(N-1)) in exactly one position, say the jth position, where c(j) = b(j)+ 2(a). All the main parameters of the codes are obtained as [Nm3(N-1), m3(N-1), 2N](p). Also, we determine linear codes from incidence matrices of Bouwer graphs B(N, 4, 5), B(N, 6, 7) and all the main parameters of the codes are obtained as [ 4N5(N-1), 4x5(N-1), 2N](p), [6N7(N-1), 6x 7(N-1), 2N](p). All the above codes can be used for full error correction by permutation decoding.