Reference articles on history, science, culture and more
Surprise meSurprise meSubscribe
Encyclopedia

Gold code

Binary sequence used in telecommunications

Wikipedia contributorsAdapted for Fathomly · View authors
1 min read
Source updated July 30, 2026

A Gold code, also known as Gold sequence, is a type of binary sequence used in telecommunications (CDMA) and satellite navigation (GPS). Gold codes are named after Robert Gold. Gold codes have bounded small cross-correlations within a set, which is useful when multiple devices are broadcasting in the same frequency range. A set of Gold code sequences consists of 2n + 1 sequences each one with a period of 2n − 1.

A set of Gold codes can be generated with the following steps. Pick two maximum-length sequences of the same length 2n − 1 such that their absolute cross-correlation is less than or equal to 2(n+2)/2, where n is the size of the linear-feedback shift register used to generate the maximum-length sequence. The set of the 2n − 1 exclusive-ors of the two sequences in their various phases (i.e. translated into all relative positions) together with the two maximum-length sequences form a set of 2n + 1 Gold code sequences. The highest absolute cross-correlation in this set of codes is 2(n+2)/2 + 1 for even n and 2(n+1)/2 + 1 for odd n.

The exclusive or of two different Gold codes from the same set is another Gold code in some phase.

Within a set of Gold codes about half of the codes are balanced , the number of ones and zeros differs by only one.

Gold codes are used in GPS. The GPS C/A ranging codes are Gold codes of period 1,023.

Watch videos about Gold codeExplainers and documentaries on YouTube (opens in a new tab)

Sources and credits

This article is adapted from the Wikipedia article “Gold code”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.

Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.

Continue exploring

Related topics

Hadamard code

The Hadamard code is an error-correcting code named after the French mathematician Jacques Hadamard that is used for error detection and correction when transmitting messages over very noisy or unreliable channels. In 1971, the code was used to transmit photos of Mars back to Earth from the NASA space probe Mariner 9.

Hamming code

In computer science and telecommunications, Hamming codes are a family of linear error-correcting codes. Hamming codes can detect one-bit and two-bit errors, or correct one-bit errors without detection of uncorrected errors.

JPL sequence

JPL sequences or JPL codes consist of two linear feedback shift registers whose code sequence lengths La and Lb must be prime (relatively prime). In this case the code sequence length of the generated overall sequence Lc is equal to: L c = L a ⋅ L b = ( 2 n − 1 ) ( 2 m − 1 ) {\displaystyle L_{c}=L_{a}\cdot L_{b}=(2^{n}-1)(2^{m}-1)} It is also possible for more than two LFSRs to be interconnected through multiple XORs at the output for as long as all code sequence lengths of the individual LFSR are relatively prime to one another.