A synthesis of barker sequences is by means of numerical bundles

Transformation of Information Based on Noisy Codes

“…The best code for creating a noisy sequence is the Barker code, but it has a lot of redundancy. To reduce it, we will build the noisy codes based on the Golomb rulers [13,14].…”

Synthesis Method and FPGA Realization of Quasi-barker Codes

“…In the general case, the simplicity of the numerical ruler bundle (NRB) of the order of N in the sequence of N numbers, is called the sequence K N =(k 1 , k 2 , …, k N ), in which sum take the values of all L N numbers starting from a given number. In a simpler version, these amounts exhaust the values of the numbers of the natural series 1, 2, …, L N [5].…”

“…Quasi-barker codes in length L N =14 … 40 are described in [5]. For each of the lengths L N of these quasi-barker codes, the level of sidelobes of the normalized correlation function is minimal.…”

“…As an example, let's consider the building of quasi-barker code according to the above algorithm for N=12, L N =21, R=7 [5]. To do this one need to take a few steps:…”

“…Research results [5,10] showed that there are no Barker signals with an odd number of positions greater than 13 for which the values of ACF do not exceed one (with the exception of the mainlobe). Among the well-known Barker signals, the maximum ratio of the mainlobe to other lobes is 13, while the ratio of quasi-barker code signals found to be equal to 14 or more [6].…”