Pseudo random sequence has broad applications in stream cipher

channel coding

and spread spectrum communication.Linear complexity and its robustness are important features of pseudo randomness.C Ding presented a novel class of sequences with ideal autocorrelation and almost balanced 0-1 distribution.This paper discusses other pseudo-randomness of such sequences.The major results are the following:such sequences have quite satisfactory linear complexities;their linear complexities do not degenerate under single symbol substitution.