On binary linear codes which satisfy the two-way chain condition
General constructions of binary linear codes satisfying the two-way chain condition are found, Sufficient conditions for their existence are determined, Some of these codes are proven to be Z(4)-linear. An expression for their state complexity profile is also found, Cases, when such codes have covering radius R = t[n, k] are shown.
binary linear codes two-way chain condition state complexity