In this paper, we present some fundamental concepts and theoretical advances attributable to Solomon Golomb, together with the history and applications of this paper to communications, coding, and cryptography, along with some long-standing conjectures. Examples include the first engineering problem relating to feedback shift-register sequences that Sol Golomb was asked to solve in the mid-1950s. This paper covers m-sequences and Golomb's three randomness postulates, the cross-correlation of m-sequences, the exp-Golomb code, the Golomb ruler, Costas arrays, Golomb invariants, polyominoes, the distribution of prime numbers, and irreducible polynomials.
No takes yet. Share an insight, caveat, or question.
Gong et al. (2018) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: