binseq.com
All Zeros or Ones is a sequence where all digits are either 0 or 1. For example, 0000 ors 1111.
Alternating Sequence is a sequence where the digits alternate between 0 and 1. For example, 01010101 or 10101010.
Palindrome Sequence is a sequence that reads the same forwards and backwards. For example, 0110 or 110011.
Gray Code is a binary numeral system where two successive values differ in only one bit. For example, in 3-bit Gray code, the sequence is 000, 001, 011, 010, 110, 111, 101, 100.
Fibonacci Sequence is a sequence where each number is the sum of the two preceding ones, starting from 0 and 1. For example, 001011010011010 is the Fibonacci sequence in binary.
Prime Number Representation is a sequence where each position corresponds to whether the index number is prime (1) or not (0). For example, 1011010101100110 represents the prime numbers from 1 to 16.
M-sequences are binary sequences that are generated using feedback shift registers (FSRs). They have good autocorrelation and cross-correlation properties and are widely used in spread spectrum communication and cryptography.
Kasami sequences are binary sequences that are constructed by combining two m-sequences using a specific algorithm. They have good correlation properties and are used in CDMA (Code Division Multiple Access) communication systems.
Gold sequences are binary sequences that are generated by combining two m-sequences with different periods using the Exclusive-OR (XOR) operation. They have good autocorrelation and cross-correlation properties and are widely used in spread spectrum communication and cryptography.
Zadoff-Chu sequences are complex sequences that are widely used in LTE (Long-Term Evolution) communication systems. They have good correlation properties and are used for synchronization and channel estimation.
It is a binary sequence: Each element of the sequence can take on one of two possible values, either 0 or 1.
It is a periodic sequence: The sequence repeats itself after a fixed number of bits, which is called the sequence length or the code length.
It has a specific autocorrelation function: The autocorrelation function of the Barker code is designed to have a low sidelobe level. This means that the cross-correlation between two Barker codes with the same length is also low, which makes it easier to detect and synchronize with the signal.
It is a self-complementary sequence: If you invert the bits in a Barker code, you get another Barker code of the same length.
Barker codes are named after their inventor, Ronald Hugh Barker, who published a study in 1953. They have found widespread use in various applications, including radar, sonar, spread spectrum communications, and signal processing. The most common Barker codes have lengths of 2, 3, 4, 5, 7, 11, and 13 bits, and they are widely used in various communication and signal processing systems.
Here are the seven most common Barker codes and their corresponding binary sequences:
Barker code of length 2: 10
Barker code of length 3: 110
Barker code of length 4: 1101 or 1110
Barker code of length 5: 11101
Barker code of length 7: 1110010
Barker code of length 11: 11100010010
Barker code of length 13: 1111100110101
Each Barker code has its unique properties and applications, depending on its length and the specific requirements of the system. For example, shorter Barker codes with lower autocorrelation sidelobes are often used in pulse compression radar systems, while longer Barker codes are used in spread spectrum communications to provide increased security and robustness against interference.