We define ${\mathcal B}_n$ to be the set of $n$-tuples of the form $(a_0, {\ldots}\,, a_{n-1})$ where $a_j = \pm 1$. If $A \in {\mathcal B}_n$, then we call $A$ a binary sequence and define the autocorrelations of $A$ by $c_k := \sum_{j=0}^{n-k-1} a_j a_{j+k}$ for $0 \leq k \leq n-1$. The problem of finding binary sequences with autocorrelations ‘near zero’ has arisen in communications engineering and is also relevant to conjectures of Littlewood and Erdős on ‘flat’ polynomials with $\pm 1$ coefficients. Following Turyn, we define \[ b(n) := \min_{A \in {\mathcal B}_n} \max_{1 \leq k \leq n-1} |c_k|.\] The purpose of this article is to show that, using some known techniques from discrete probability, we can improve upon the best upper bound on $b(n)$ appearing in the previous literature, and we can obtain both asymptotic and exact expressions for the expected value of $c_k^m$ if the $a_j$ are independent $\pm 1$ random variables with mean 0. We also include some brief heuristic remarks in support of the unproved conjecture that $b(n) = O(\sqrt{n})$.