Improvement of exponent estimates for mixing graphs of bijective shift registers over a set of binary vectors

This article presents new estimates for lengths of simple paths and cycles in the mixing graph $G$ of a bijective shift register over a binary vectors set. Also, some sufficient conditions for primitiveness of $G$ are obtained. An upper bound given earlier for the exponent of $G$ is reduced.