On linear projective codes which satisfy the chain condition. (Q1961821)

Binary linear codes with length at most one above the Griesmer bound were shown to satisfy the chain condition by \textit{T. Helleseth}, \textit{T. Kløve} and \textit{Ø. Ytrehus} [IEEE Trans. Inf. Theory 38, 1133--1140 (1992; Zbl 0749.94012)]. Binary linear projective codes with length two above the Griesmer bound satisfying the chain condition are found. Necessary conditions for binary linear projective two-weight codes for which the two-way chain condition holds are derived. These conditions are applied to prove that a number of subcodes of the extended Golay code do not satisfy the two-way chain condition.