Time: 2018-12-07 15：00-16：00

Venue: Room 201 Lecture Hall

abstract：Maximal length sequences (m-sequences) over an alphabet of size p, p a prime, are sequences having period p^n –1 that are generated by a linear recursion of degree n. These sequences have many nice applications due to their celebrated two-valued autocorrelation property. There are several other sequences with similar two-level autocorrelation properties. In this talk we present a brief overview and history of the problem of finding binary and non-binary sequences with a two-valued autocorrelation.