The notion of quasi-random graphs was introduced in 1987 by F. R. K. Chung, R. L. Graham and R. M. Wilson, resp. A. Thomason. It has been shown that there is a strong connection between this notion and the pseudorandomness of (finite) binary sequences. This connection can be utilized for constructing large families of quasi-random graphs by considering graphs defined by a circular adjacency matrix whose first column is a binary sequence with strong pseudo-random properties. Starting out from this construction principle one may extend, generalize and sharpen some definitions and results on quasi-randomness of graphs.[-]

The cross-combined measure (which is a natural extension of crosscorrelation measure) is introduced and important constructions of large families of binary lattices with nearly optimal cross-combined measures are presented. These results are important in the study of large families of pseudorandom binary lattices but they are also strongly related to the one dimensional case: An easy method is showed obtaining strong constructions of families of binary sequences with nearly optimal cross-correlation measures based on the previous constructions of lattices. The important feature of this result is that so far there exists only one type of constructions of very large families of binary sequences with small cross-correlation measure, and this only type of constructions was based on one-variable irreducible polynomials. Since it is very complicated to construct one-variable irreducible polynomials over $\mathbb{F}_p$, it became necessary to show other types of constructions where the generation of sequences are much faster. Using binary lattices based on two-variable irreducible polynomials this problem can be avoided, however a slightly weaker upper bound is obtained for the cross-correlation measure than in the original construction. (But, contrary to one-variable polynomials, using Schöneman-Eisenstein criteria it is very easy to construct two-variable irreducible polynomials over $\mathbb{F}_p$.)[-]