Chapter 1. Introduction 1.1. Motivation 1.2. Overview of new results Chapter 2. Preliminaries 2.1. Sequences and cryptographic properties 2.2. Maximal length sequences 2.3. Construction of GMW sequences by interleaved approach 2.4. Character sums over finite fields 2.5. Costas sequences 2.6. Some well-known signal sets (families) Chapter 3. Interleaved sequences 3.1. (f (x), m)-interleaved sequences 3.2. IRI-sequences 3.3. Signal sets (families) generated by (f (x), m)−sequences 3.4. A new variant of the interleaved algorithm Chapter 4. Correlation properties and linear complexity of interleaved binary sequences 4.1. Correlation property 4.2. The correlation values of binary interleaved sequences 4.3. Linear complexity of binary interleaved sequences Chapter 5. Linear complexity profile, correlation measures and nonlinearity v vi 5.1. Linear complexity profile of m-ary interleaved sequences 5.2. Relating linear complexity profile and (power) correlation measures 5.3. Nonlinearity of the boolean function derived from binary interleaved sequences Chapter 6. Zero correlation zone of interleaved polyphase sequences 6.1. A new class of almost perfect sequences 6.2. Interleaved construction of polyphase sequences 6.3. A Zero-Correlation Zone (ZCZ) signal set (family) Chapter 7. Shift-addition construction 7.1. Shift and add property and shift-addition construction 7.2. Shift-addition family from m-ary power residue sequences 7.3. Shift-addition family from two-prime generators of order 2 Chapter 8. Future work Bibliography CHAPTER 1