Binary sequences of period N with 2-level autocorrelation have many important applications in communications and cryptology. From Section 7.1, 2-level autocorrelation sequences are in natural correspondence with cyclic Hadamard difference sets with v = N, k = ( N 1) /2, and ? = ( N 3) /4. For this reason, they are named cyclic Hadamard sequences. In this chapter, 2-level autocorrelation always means ideal 2-level autocorrelation. There are three classic constructions for binary 2-level autocorrelation sequences that were known before 1997 (including some generalizations along these lines after 1997). One is m-sequences, described in Chapter 5, with period N = 2 ⁿ 1. The second construction is based on a number theory approach, including three types of sequences in Chapter 2, which are the quadratic residue sequences, Hall sextic residue sequences, and twin prime sequences. The period of such a sequence is either a prime or a product of twin primes. The third construction is associated with intermediate subfields. The resulting sequences have subfield decompositions and period N = 2 ⁿ 1. They include GMW sequences, cascaded GMW sequences, and generalized GMW sequences. Although the resulting sequences are binary, this construction relies heavily on intermediate fields and compositions of functions. As a consequence, it involves sequences over intermediate fields that are not binary sequences. The content of this chapter is organized as follows. In Section 8.1, we investigate general constructions for 2-level autocorrelation sequences...