Gold code[1]


Member of the family of \([2^r-1, 2r ]\) cyclic binary linear code characterized by the generator polynomial of degree \(r\) of two maximum-period sequences of period \(2^r-1\) with absolute cross-correlation \( \leq 2^{(r+2)/2}\). Gold codewords are generated using \(m\)-sequences \(x\) and \(y\), which are codewords of simplex codes with check polynomials of degree \(r\) [1].


Information bits are initialized in the shift registers of the two \(m\)-sequences \(x\) and \(y\).


General decoding is done by building a sparse parity check matrix, followed by applying an iterative message passing alogirithm. [2].


Used in for synchronization purposes in telecommunication [3]GPS C/A for satellite navigation [4].



  • Simplex code — Simplex codes are used to make gold codes.


R. Gold, “Optimal binary sequences for spread spectrum multiplexing (Corresp.)”, IEEE Transactions on Information Theory 13, 619 (1967) DOI
O. W. Yeung and K. M. Chugg, “An Iterative Algorithm and Low Complexity Hardware Architecture for Fast Acquisition of Long PN Codes in UWB Systems”, Journal of VLSI signal processing systems for signal, image and video technology 43, 25 (2006) DOI
Mujtaba Hamid and Andy Miller, Gold Code Generators in Virtex Devices, (2000)
J. J. SPILKER Jr., “GPS Signal Structure and Performance Characteristics”, Navigation 25, 121 (1978) DOI
Page edit log

Your contribution is welcome!

on (edit & pull request)

edit on this site

Zoo Code ID: gold

Cite as:
“Gold code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022.
@incollection{eczoo_gold, title={Gold code}, booktitle={The Error Correction Zoo}, year={2022}, editor={Albert, Victor V. and Faist, Philippe}, url={} }
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:

Cite as:

“Gold code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022.