Linear binary codes with intersection properties (Q800294)

Let p(n,d) (resp. q(n,d)) be the maximal dimension of a binary linear code of length n such that any two distinct nonzero codewords agree in at least (resp. at most) d nonzero positions. It is proved that \(q(n,d)=\min\{n,d+1\}.\) Some bounds for p(n,d) are established, and constructions of related codes are given as well.