Projective codes which satisfy the chain condition Original Research Article

Binary linear codes with length at most one above the Griesmer bound were proven to satisfy the chain condition by Helleseth et al. [1]. Binary linear projective codes with length two above the Griesmer bound which satisfy the chain condition are found. Necessary conditions for binary linear codes for which the two-way chain condition holds are derived.