This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Elias–Bassalygo bound | |
|---|---|
| Name | Elias–Bassalygo bound |
| Field | Coding theory |
| Introduced | 1960s |
| Authors | Peter Elias, Alexander Bassalygo |
| Related | Hamming bound, Gilbert–Varshamov bound, Plotkin bound |
Elias–Bassalygo bound The Elias–Bassalygo bound is a fundamental asymptotic upper bound in coding theory on the rate of binary error-correcting codes given a minimum relative distance. It strengthens earlier limits such as the Hamming bound for certain regimes and is closely related to lower bounds like the Gilbert–Varshamov bound and upper bounds such as the Plotkin bound. The bound plays a central role in analyses linked to combinatorial constructions from researchers associated with institutions like Bell Labs and universities such as Massachusetts Institute of Technology.
The Elias–Bassalygo bound arose in work by Peter Elias and Alexander Bassalygo combining combinatorial, probabilistic, and geometric techniques developed in mid-20th century coding research at places including Princeton University and Moscow State University. It provides a limit on achievable rates for binary block codes studied in contexts like the Shannon–Hartley theorem discussions and complements constructive results from authors associated with the IEEE and the Association for Computing Machinery conferences. The bound is stated in terms of code length, minimum Hamming distance, and asymptotic rate; it informs design choices in applications ranging from NASA telemetry to storage devices researched by companies such as IBM.
Let A(n,d) denote the maximum size of a binary block code of length n with minimum Hamming distance d. For relative distance δ = d/n and rate R = (1/n) log2 A(n,d), the Elias–Bassalygo bound asserts that asymptotically R ≤ 1 - H2(τ) + o(1), where τ is given by a function of δ via sphere-packing relations and H2 is the binary entropy function used in works by Claude Shannon and featured in analyses by Richard Hamming. In alternative formulations, the bound is expressed using the volume of Hamming balls and relations to the Plotkin bound and the Gilbert–Varshamov bound. The precise asymptotic expression refines earlier combinatorial inequalities introduced in the literature of John von Neumann-era information theory.
Derivations of the Elias–Bassalygo bound employ combinatorial covering arguments, averaging techniques, and linear-algebraic projections used in proofs by Elias and later expositions by researchers at institutions such as Bell Labs and Stanford University. One standard proof begins with packing Hamming balls around codewords, applies the Johnson bound and sphere-covering estimates, and then uses the convexity of entropy functions studied in work by Andrey Kolmogorov and Claude Shannon. Alternative proofs use linear programming techniques that relate to methods introduced by Delsarte and later refined by researchers at École Polytechnique and Princeton University. Probabilistic methods invoking Chernoff bounds and techniques from Paul Erdős-inspired probabilistic combinatorics also yield intuitive derivations that connect to results in Alon–Spencer style frameworks.
The Elias–Bassalygo bound constrains achievable parameters for codes used in reliable communication systems deployed by organizations like European Space Agency and Australian Space Agency, and informs practical code designers at companies such as Qualcomm and Intel. In theoretical computer science, it impacts hardness reductions studied at conferences organized by the Association for Computing Machinery and the Institute of Electrical and Electronics Engineers. The bound also influences explicit construction efforts for codes with parameters near theoretical limits pursued by researchers at Massachusetts Institute of Technology, University of California, Berkeley, and Tel Aviv University. Its implications extend to complexity-theoretic results about error-correcting codes in reductions used by Cook-style NP-completeness frameworks.
Compared with the Hamming bound, the Elias–Bassalygo bound is tighter in regions of moderate relative distance δ and often improves on the asymptotic Hamming limit derived from sphere-packing arguments promoted by early work of Hamming. Against the Gilbert–Varshamov bound, which provides lower existence bounds often achieved via randomized constructions prevalent in probabilistic method literature influenced by Erdős, Elias–Bassalygo is an upper bound and thereby delineates the gap between existence and impossibility. For very large δ, the Plotkin bound and bounds by McEliece or Elias himself may dominate; comparisons are standard in textbooks originating from authors at MIT Press and Cambridge University Press.
Concrete code families considered against the Elias–Bassalygo limit include BCH codes developed at Cyclotomic fields research groups, Reed–Solomon codes from work by Irving S. Reed and Gustave Solomon, and newer algebraic-geometric codes inspired by work at Uppsala University and École Normale Supérieure. Random linear codes, studied by Vladimir Levenshtein and contemporaries, typically approach the Gilbert–Varshamov bound from below but are bounded above by Elias–Bassalygo asymptotics. Explicit constructions using concatenated codes from ideas by Forney and expander-based codes influenced by researchers at Princeton University offer practical parameters whose rates can be directly compared to the Elias–Bassalygo curve.