a u201c 0 u201d could represent a location that does not have a line ideally each of these codes is chosen so that one random auto correlation peak is produced it is this property that optimizes the choice of line spacing that reduces the road noise spectral density to a minimum in the preferred embodiment one would realize the greatest benefit with sequence lengths that don 39 t repeat very often line patterns with repetition lengths greater than 250 are probably most beneficial but patterns as long as 2600 lines may still provide additional benefits the longer the pattern the more effective the randomness becomes in general this technique can be applied to any sequence length chosen as an example one would apply the above theory to arrive at the following implementation polynomials in the first polynomial the taps with exponents 7 and 1 are summed to form a linear code with optimal random properties in the second example the exponents 9 4 and 1 would be summed tables of optimal feedback connections for these exponents are widely known the implementation can be applied to any sequence length but practical limitations exist with implementations of very long sequences each of the equations shown describes a successively longer and therefore more optimal method of generating the sequence that one would use to make the rake or cut.