What Are Binary Sequences?

Binary sequences are ordered strings of symbols drawn from a two-element alphabet, conventionally represented as 0 and 1. They are the fundamental unit of digital information, encoding everything from single bits to complete data streams used in computation, communications, and storage. The study of binary sequences as a mathematical and engineering discipline concerns their algebraic structure, their correlation properties, and the systematic ways they can be generated and decoded to serve specific purposes in information systems.

The field draws on discrete mathematics, abstract algebra, and information theory. Claude Shannon's 1948 work establishing the mathematical foundations of communication laid the theoretical ground for understanding how binary sequences carry information and how they can be encoded to withstand transmission errors. Standards bodies including IEEE have codified many of the sequence types and coding schemes built on this foundation.

Representation and Encoding

A binary sequence of length n can be viewed as an element of the vector space GF(2)^n, where GF(2) is the Galois field with two elements. This algebraic perspective underlies the design of linear codes, in which valid code words form a subspace defined by a generator matrix or, equivalently, a parity-check matrix. The Hamming weight of a sequence, which counts the number of 1s it contains, and the Hamming distance between two sequences, which counts the positions where they differ, are the primary metrics governing error detection and correction. An introduction to error-correcting codes developed at UC San Diego provides a thorough treatment of these foundations. The relationship between minimum distance and error-correcting capacity is central to all practical coding design.

Pseudorandom and Spread-Spectrum Sequences

A particularly important class of binary sequences is the pseudorandom sequence, a deterministic sequence that passes statistical tests for randomness while remaining reproducible from a known seed. Maximum-length sequences, also called m-sequences, are generated by linear feedback shift registers and achieve the maximum possible period of 2^n - 1 for a register of length n, while exhibiting nearly ideal autocorrelation: the sequence correlates strongly with itself only at zero lag and nearly uniformly low elsewhere. This correlation property makes m-sequences and related families, including Gold codes and Kasami sequences, valuable for spread-spectrum communications, where multiple users share a channel by transmitting on orthogonal or near-orthogonal codes. IEEE Xplore hosts extensive research on how these properties affect error probabilities in binary direct-sequence spread-spectrum communications, a foundation for CDMA cellular networks.

Sequence Families in Modern Standards

Specific binary sequence families appear throughout contemporary digital standards. LDPC codes, or low-density parity-check codes, represent valid code words as binary sequences constrained by a sparse parity-check matrix; their near-capacity performance has led to their adoption in standards including IEEE 802.11n, IEEE 802.16e (WiMAX), 10GBase-T Ethernet, and DVB-S2. Turbo codes, which concatenate convolutional encoders with an interleaver, similarly produce binary sequences whose structure allows iterative decoding to approach Shannon capacity. In cryptography, certain binary sequences with strong unpredictability properties serve as keystream generators in stream ciphers. The Error Correction Zoo maintained by Caltech catalogs the full taxonomy of binary codes and their structural relationships.

Applications

Binary sequences have applications across a wide range of engineering and scientific domains, including:

• Channel coding and forward error correction in wireless and optical communications
• Spread-spectrum and code-division multiple access (CDMA) systems
• Cryptographic key generation and stream cipher design
• Radar and sonar ranging using pulse compression with pseudorandom sequences
• Synchronization and timing acquisition in digital receivers