New properties and methods about the linear complexity and the k-error linear complexity of binary 2n-periodic sequences are provided. Using Games-Chan algorithm and new method, we give some new results about k-error linear complexity, and the method to count the number of critical error sequences is also provided.