Proof of a conjecture and a bound on the imbalance properties of LFSR subsequences

Linear feedback shift registers (LFSRs) are widely used in cryptography, circuit testings and communications. In this paper, we prove a conjecture on a trigonometric inequality. Using this inequality, we investigate the imbalance properties of LFSR subsequences and deduce an upper bound.