Two approaches to bounding the partial auto-and crosscorrelations of b
inary sequences are considered. The first approach uses the discrete F
ourier transform and bounds for character sums to obtain bounds on par
tial autocorrelations of m-sequences and on the partial auto-and cross
correlations for the small Kasami sets and dual-BCH families of sequen
ces. The second approach applies to binary sequences obtained by inter
leaving m-sequences, A bound on the peak partial correlation of such s
equences is derived in terms of the peak partial autocorrelation of th
e underlying m-sequences, The bound is applied to GMW, No, and other f
amilies of sequences for particular parameters. A comparison of the tw
o approaches shows that the elementary method gives generally weaker r
esults but is more widely applicable, On the other hand, both methods
show that well-known sequence families can have favorable partial corr
elation characteristics, making them useful in certain spread-spectrum
applications.