Solomon W. Golomb | Academic Influence

Solomon W. Golomb's AcademicInfluence.com Rankings

Solomon W. Golomb

Mathematics

#364

World Rank

#753

Historical Rank

#172

USA Rank

Measure Theory

#288

World Rank

#445

Historical Rank

#126

USA Rank

mathematics Degrees

Download Badge

Mathematics

Solomon W. Golomb's Degrees

Bachelors Mathematics City College of New York

Similar Degrees You Can Earn

Best Online Bachelor's in Math Ranked

Why Is Solomon W. Golomb Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Solomon Wolf Golomb was an American mathematician, engineer, and professor of electrical engineering at the University of Southern California, best known for his works on mathematical games. Most notably, he invented Cheskers in 1948. He also fully described polyominoes and pentominoes in 1953. He specialized in problems of combinatorial analysis, number theory, coding theory, and communications. Pentomino boardgames, based on his work, would go on to inspire Tetris.

(See a Problem?)

Solomon W. Golomb's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Shift Register Sequences (1981) (1676)
Run-length encodings. (1966) (970)
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar (2005) (899)
Run-length encodings (Corresp.) (1966) (758)
Backtrack Programming (1965) (514)
Applications of numbered undirected graphs (1977) (423)
Constructions and properties of Costas arrays (1984) (338)
Generalized Barker sequences (1965) (226)
Perfect Codes in the Lee Metric and the Packing of Polyominoes (1970) (222)
HOW TO NUMBER A GRAPH††This research was supported in part by the United States Air Force under Grant AFOSR-68-1555. (1972) (221)
Polyominoes: Puzzles, Patterns, Problems, and Packings (1994) (208)
Algebraic Constructions for Costas Arrays (1984) (174)
Two-dimensional synchronization patterns for minimum ambiguity (1982) (166)
Comma-Free Codes (1958) (159)
Checker Boards and Polyominoes (1954) (156)
Digital communications with space applications (1964) (153)
Numbered complete graphs, unusual rulers, and assorted applications (1978) (112)
Binary Pseudorandom Sequences of Period 2n-1 with Ideal Autocorrelation (1998) (111)
Polyominoes (2020) (107)
On the classification of Boolean functions (1959) (90)
A new construction of 64-QAM golay complementary sequences (2006) (84)
Discovery of an Hadamard matrix of order 92 (1962) (78)
Two-valued sequences with perfect periodic autocorrelation (1992) (77)
Polyphase sequence with low autocorrelations (1993) (74)
Transform domain analysis of DES (1999) (70)
Tiling with sets of polyominoes (1970) (68)
Codes With Bounded Synchronization Delay (1965) (66)
A new recursive construction for optical orthogonal codes (2003) (66)
A Connected Topology for the Integers (1959) (66)
Tiling with polyominoes (1966) (64)
On the classification of balanced binary sequences of period 2n-1 (Corresp.) (1980) (64)
The limiting behavior of the Z-channel (Corresp.) (1980) (62)
Replicating Figures in the Plane (1964) (62)
Rook domains, Latin squares, affine planes, and error-distributing codes (1964) (60)
The information generating function of a probability distribution (Corresp.) (1966) (59)
Construction of Signals with Favorable Correlation Properties (1999) (44)
Permutations by Cutting and Shuffling (1961) (43)
A Note on Low-Correlation Zone Signal Sets (2007) (41)
Polyominoes which tile rectangles (1989) (40)
The Status of Costas Arrays (2007) (40)
Mathematical Models: Uses and Limitations (1971) (40)
Basic Concepts in Information Theory and Coding (1994) (40)
On the existence of cyclic Hadamard difference sets (1994) (39)
The Search for Hadamard Matrices (1963) (38)
A mathematical investigation of games of “take-away” (1966) (38)
Theory of transformation groups of polynomials over GF(2) with applications to linear shift register sequences (1968) (36)
Sixty-phase generalized Barker sequences (1989) (36)
Recent Results on Polyphase Sequences (1998) (33)
Signal Design for Good Correlation: Preface (2005) (31)
Linear spans of modified de Bruijn sequences (1990) (31)
On the nonperiodic cyclic equivalence classes of Reed-Solomon codes (1993) (30)
On periodicity properties of Costas arrays and a conjecture on permutation polynomials (1994) (28)
On a conjectured ideal autocorrelation sequence, a related triple-error correcting cyclic code (2000) (27)
The T4 and G4 constructions for Costas arrays (1992) (27)
Basic Concepts in Information Theory and Coding: The Adventures of Secret Agent 00111 (1994) (24)
On the Sum of the Reciprocals of the Fermat Numbers and Related Irrationalities (1963) (24)
Shift Register Sequences: Secure and Limited-Access Code Generators, Efficiency Code Generators, Prescribed Property Generators, Mathematical Models (2017) (23)
Optimal Families of Perfect Polyphase Sequences From the Array Structure of Fermat-Quotient Sequences (2016) (23)
Tuscan-K squares (1989) (23)
On Certain Nonlinear Recurring Sequences (1963) (23)
A general formulation of error matrices (Corresp.) (1969) (21)
Sources Which Maximize the Choice of a Huffman Coding Tree (1980) (21)
A class of probability distributions on the integers (1970) (21)
Integer Convolutions over the Finite Field $GF( {3 \cdot 2^n + 1} )$ (1977) (20)
Characterizations of generators for modified de Bruijn sequences (1992) (19)
Sequences, Subsequences, and Consequences, International Workshop, SSC 2007, Los Angeles, CA, USA, May 31 - June 2, 2007, Revised Invited Papers (2007) (18)
The decimation-Hadamard transform of two-level autocorrelation sequences (2002) (17)
Some new constructions for simplex codes (1994) (16)
Combinatorial Proof of Fermat's "Little" Theorem (1956) (16)
Tiling Deficient Rectangles with Trominoes (2004) (16)
On the Enumeration of Polygons (1960) (16)
7200-phase generalized Barker sequences (1996) (15)
Binary Sequences with Two-Level Autocorrelation (1999) (15)
Periodic binary sequences with the "trinomial property" (1997) (15)
Shift Register Sequences - A Retrospective Account (2006) (14)
The Largest Graceful Subgraph of the Complete Graph (1974) (14)
There Are No Further Counterexamples to S. Piccard's Theorem (2007) (13)
On n-phase Barker sequences (1994) (13)
Mathematical entertainments (1996) (13)
A New Result on Comma-Free Codes of Even Word-Length (1987) (13)
CYCLOTOMIC POLYNOMIALS AND FACTORIZATION THEOREMS (1978) (13)
The lambda method in prime number theory (1970) (13)
Extended sonar sequences (1995) (13)
Generating all linear orthomorphisms without repetition (1999) (13)
Obtaining Specified Irreducible Polynomials over Finite Fields (1980) (12)
A Direct Interpretation of Gandhi's Formula (1974) (12)
Irreducible Polynomials Which Divide Trinomials Over GF$\,(2)$ (2007) (12)
CYCLES FROM NONLINEAR SHIFT REGISTERS (1959) (11)
A class of pseudonoise-like pulse compression codes (1992) (11)
An Algebraic Algorithm for the Representation Problems of the Ahmes Papyrus (1962) (11)
Signal Design for Good Correlation: Applications of Correlation to the Communication of Information (2005) (11)
Cyclic Hadamard Difference Sets - Constructions and Applications (1998) (10)
The Twin Prime Constant (1960) (10)
Optimal Interleaving Schemes for Two-Dimensional Arrays (2006) (9)
On the Number of Permutations onnObjects with Greatest Cycle Lengthk (1998) (9)
On the characteristics of PN sequences (1983) (9)
Formulas for the next prime (1976) (9)
Optical disk error correction (1986) (9)
Optimal interleaving schemes for correcting 2-D cluster errors (2004) (9)
On the Ratio of N to π(N) (1962) (9)
Circular Tuscan-k Arrays from Permutation Binomials (2002) (9)
On the Classification of Cyclic Hadamard Sequences (2006) (8)
Optimal interleaving schemes for correcting two-dimensional cluster errors (2007) (8)
Constructions of Orthomorphisms of ℤ2n (2001) (8)
Exhaustive determination of (1023, 511, 255)-cyclic difference sets (2001) (8)
On peace in the Middle East (2006) (8)
Review: Elwyn R. Berlekamp, John H. Conway and Richard K. Guy, Winning ways for your mathematical plays (1983) (8)
Uniqueness of the generalized Barker sequence of length 6 (1990) (8)
Iterated Binomial Coefficients (1980) (7)
Hadamard transforms of three-term sequences (1999) (7)
On the Cryptanalysis of Nonlinear Sequences (1999) (7)
The Evidence for Fortune's Conjecture (1981) (7)
The Polynomial Model in the Study of Counterexamples to S. Piccard's Theorem (1998) (7)
A note on the equivalence between strict optical orthogonal codes and difference triangle sets (2003) (6)
Nonlinear shift registers that produce all vectors of weight <or=t (1992) (6)
On a sequence conjectured to have ideal 2-level autocorrelation function (1998) (6)
A function-theoretic approach to the study of nonlinear recurring sequences. (1975) (6)
Sequences and Their Applications - SETA 2014 (2014) (6)
On the survival of sequence information in filters (Corresp.) (1972) (6)
Retrospective: Claude E. Shannon (1916-2001) (2001) (6)
SEQUENCES WITH RANDOMNESS PROPERTIES (2017) (6)
On Ideal Autocorrelation Sequences Arising from Hyperovals (1998) (6)
Sets of primes with intermediate density (1955) (6)
Algebraic Symmetries of Generic $(m+1)$-Dimensional Periodic Costas Arrays (2012) (5)
A new arithmetic function of combinatorial significance (1973) (5)
An Octomino of High Order (1995) (5)
A New Construction of 16-QAM Near Complementary Sequences (2008) (5)
Faculty Consulting: Should It Be Curtailed?. (1979) (5)
On Factoring Jevons' Number (1996) (5)
Cryptographic Reflections on the Genetic Code (1980) (4)
Cyclic Projective Planes, Perfect Circular Rulers, and Good Spanning Rulers (2001) (4)
ON THE FACTORIZATION OF TRINOMIALS OVER GF 2 (1959) (4)
Signal Design for Good Correlation: Feedback Shift Register Sequences (2005) (4)
Rubik’s cube and a model of quark confinement (1981) (4)
Problem 11214 (2006) (4)
Probability, information theory, and prime number theory (1992) (4)
Properties of the sequences 3⋅2ⁿ+1 (1976) (4)
On enumerative equivalence of group elements (1968) (4)
The Status of Costas Array Construction (2006) (4)
Enumeration and criteria for cyclically shift-distinct GMW sequences (2000) (4)
Sequences and Their Applications - SETA 2008, 5th International Conference, Lexington, KY, USA, September 14-18, 2008, Proceedings (2008) (4)
Progressions in Every Two-Coloration of Zn (1992) (4)
A limit theorem for n-phase Barker sequences (corresp.) (1990) (4)
Periodic Binary Sequences: Solved and Unsolved Problems (2007) (4)
Optical orthogonal codes and multi-target Costas and sonar arrays (2002) (3)
Problems for Solution: 4703-4707 (1956) (3)
Cyclic inequivalence of cascaded GMW-sequences (2000) (3)
Optimal 2-D interleaving with latin rectangles (2005) (3)
A new derivation of the entropy expressions (1961) (3)
Catalogue of Solutions of the Rectangular 3 × 4 × 5 Solid Pentomino Problem (1969) (3)
On the Characterization of PN Sequences (1998) (3)
Distributions of periods and frequencies of runs in random binary sequences (1989) (3)
TILLING A DEFICIENT RECTANGLE WITH T-TETROMINOES (2012) (3)
Second Order Polynomial Recursions (1977) (3)
A Recursive Construction For Regular Difference Triangle Sets (2005) (2)
Polyominoes: Puzzles, Patterns, Problems, and Packings - Revised and Expanded Second Edition (2020) (2)
Claude Elwood Shannon (1916–2001), Volume 49, Number 1 (2)
The Fifteen Billiard Balls—a Case Study in Combinatorial Problem Solving (1985) (2)
On the crosscorrelation of generalized Barker sequences (1990) (2)
The “Sales Tax” Theorem (1976) (2)
Corrections to “Cyclotomic Polynomials and Factorization Theorems” (1981) (2)
A new optimal double periodical construction of one target two-dimensional arrays (2006) (2)
Problems for Solution: 4718-4722 (1957) (2)
Infinite Sequences with Finite Cross-Correlation-II (2010) (2)
Infinite Sequences with Finite Cross-Correlation (2010) (2)
Conjectures Involving Sequences and Prime Numbers (2014) (2)
Elementary Problems: E2143-E2189 (1969) (2)
Normed Division Domains (1981) (2)
Costas sequences for multiple targets (2002) (2)
Methanococcus genome. (1996) (2)
Elementary Problems: E3025-E3030 (1983) (2)
Ramsey's Theorem Is Sharp (2006) (2)
THE INVINCIBLE PRIMES (1985) (1)
Zipf's law as a tool in strategic, military, and economic intelligence (1962) (1)
A Proposal for Rescaling Units (2001) (1)
The Bit and the Pendulum Reviewed by (2002) (1)
New Proof of a Classic Combinatorial Theorem (1968) (1)
Optimum Seating Arrangements and Tuscan Squares (2016) (1)
On existence of 2-level autocorrelation sequences realized from the decimation-Hadamard transformation (2002) (1)
Discrete Mathematics for Communication Systems (1990) (1)
Elementary Problems: E1030,E1075,E2504-E2509 (1974) (1)
Elementary Problems: E2725-E2730 (1978) (1)
On the Enumeration of Cryptograms (1980) (1)
A Symmetry Criterion for Conjugacy in Finite Groups (1996) (1)
Properties of the Sequence 3 ⋅2 n + 1 (1976) (1)
Elementary Problems: E3088-E3092 (1985) (1)
Sets Of Sonar Sequences (1991) (1)
On the Classification of Cyclic Hadamard Sequences( Sequence Design and its Application in Communications) (2006) (1)
Elementary Problems: E2486-E2490 (1974) (1)
A Note on Low Correlation Zone Signal Sets (2006) (1)
Influence of data processing on the design and communication of experiments (1964) (1)
Which Irreducible Polynomials Divide Trinomials over GF(2)? (2004) (1)
Problems: 10306-10313 (1993) (1)
Signal Design for Good Correlation: Randomness Measurements and m -Sequences (2005) (1)
Error-correcting Codes and the Genome Project (1992) (1)
Cyrillic That Looks Roman (2013) (1)
Actions of the Unitary Group on Irreducible/Primitive Polynomials and Their Applications to Randomness of Sequences (2007) (1)
An Identity for (1992) (1)
Elementary Problems: E3289-E3294 (1988) (1)
Methanococcus genome [1] (1996) (1)
Surveys in Combinatorics, 1991: “Radar Signal Patterns from Combinatorial Designs” (1991) (1)
A Letter to Martin (2010) (1)
Mathematics Forty Years After "Sputnik" (2016) (1)
Other Combinatorial Designs (2006) (1)
The Stability of Counting Sequences Under Stage Delays (1971) (1)
Problems for Solution: E1541-E1547 (1962) (1)
Signal Design for Good Correlation: General Properties of Correlation (2005) (1)
Proof without words: A 2 × 2 determinant is the area of a parallelogram (1985) (1)
The Odd Homonym Attack - A New Figure of Speech (2010) (0)
“Periods” of de Bruijn sequences (1992) (0)
Signal Design for Good Correlation: Historical Introduction (2005) (0)
Signal Sets with Low Crosscorrelation (2005) (0)
A remembrance of peter swerling (2001) (0)
On a Boolean Maximization Problem (2002) (0)
Elementary Problems: E2803-E2808 (1979) (0)
Combinatorial Structures (2021) (0)
Combinatorial communication - A new interpretation of a basic combinatorial formula (1966) (0)
Solomon Golomb’s Course on Undergraduate Combinatorics (2021) (0)
The notion of a monotonic directed design ( v , k , 1 )-MDD was introduced to construct difference triangle sets in (0)
Transforms of Sequences and Functions (2005) (0)
Irreducible Polynomials Which Divide Trinomials (2007) (0)
Advanced Problems: 5400-5409 (1966) (0)
"Albert Leon Whiteman (1915-1995)" (1997) (0)
Problems for Solution: 4593-4597 (1954) (0)
Advanced Problems: 5310-5319 (1965) (0)
Elementary Problems: E2641-E2646 (1977) (0)
The Periodic Table of the Alphabet (1968) (0)
Letters to the Editor (2000) (0)
From TRASH to ASHTRAY (2011) (0)
Methanococcus genome. (1996) (0)
Orthogonal Sudoku Squares: 11214 (2008) (0)
Applications to Radar, Sonar, Synchronization, and CDMA (2005) (0)
Signal Design for Good Correlation: Cyclic Hadamard Sequences, Part 2 (2005) (0)
Problems for Solution: E1051-E1055 (1953) (0)
Problems: 10202-10210 (1992) (0)
Elementary Problems: E3135-E3140 (1986) (0)
Tilings and Patterns. By Branko Grünbaum and G. C. Shephard (1988) (0)
Problems for Solution: E1316-E1320 (1958) (0)
Error Correction I: Distance Concepts and Bounds (1994) (0)
THE PRESENT STATUS OF THE SHIFT REGISTER ART (2017) (0)
Constructions for Costas Arrays (1986) (0)
Combinations (2021) (0)
Problems for Solution: E1533-E1540 (1962) (0)
Problems: 10193-10201 (1992) (0)
Problem 11109 (2004) (0)
Golomb's Gambits: Word Expansion (2016) (0)
Two-Dimensional Array Coloring With Many Colors (2008) (0)
Problems for Solution: E1221-E1225 (1956) (0)
For the Love of Games (1984) (0)
Error Correction II: The Information-Theoretic Viewpoint (1994) (0)
Proceedings of the 2007 international conference on Sequences, subsequences, and consequences (2007) (0)
CORR 2001-33 Hyper-cyclotomic Algebra (2001) (0)
THE SHIFT REGISTER AS A FINITE STATE MACHINE (2017) (0)
Elementary Problems: E2115-E2124 (1968) (0)
Infinite Discrete Sources (1994) (0)
Long Words in German and Other Languages (2013) (0)
An Identity for \binom2nn (1992) (0)
14 POLYOMINOES Gill Barequet , (2017) (0)
The Unsolved Problem (1986) (0)
Counting under Symmetries (2021) (0)
Proceedings of the 5th international conference on Sequences and Their Applications (2008) (0)
Problems for Solution: 4911-4916 (1960) (0)
Problems for Solution: 4776,4793-4797 (1958) (0)
Problems Dedicated to Emory P. Starke: S30-S31 (1980) (0)
OOCs, Partial Relative Difference Families and a Conjecture of Golomb (2006) (0)
Problems: 10220-10228 (1992) (0)
Permutations (2021) (0)
Problems for Solution: E966-E970 (1951) (0)
Problems for Solution: E1041-E1045 (1952) (0)
GOLOMB'S REMINISCENCES (2003) (0)
Anagramming Co-Authors (2014) (0)
Tiling Rectangles with Trominoes: 10641 (2000) (0)
References to pentominoes (1966) (0)
Combinatorial communications - Search for cyclic Hadamard matrices (1966) (0)
Combinatorial aspects of automated designs (1966) (0)
3121. A Geometric Proof of a Famous Identity (1965) (0)
THE LEGEND OF COLUMBUS [with response] (2016) (0)
Optimal Interleaving Schemes for 2-D Arrays (2006) (0)
Elementary Problems: E3243-E3248 (1988) (0)
Practical Aspects of Coding (1994) (0)
Signal Design for Good Correlation: Finite Fields (2005) (0)
Discrete Mathematics for Communications Systems. (1985) (0)
An identity for (2nn) (1992) (0)
STRUCTURAL PROPERTIES OF PN SEQUENCES (2017) (0)
Double Duty Adjectives (2010) (0)
Problems for Solution: 4965-4970 (1961) (0)
Self-Contained Words (2012) (0)
Hyper-Cyclotomic Algebra (2001) (0)
Hebrew or Japanese (2012) (0)
Preface to the First Edition (2020) (0)
Elementary Problems: E604,E2528-E2533 (1975) (0)
A new optimal double periodical construction of one target two-dimensional arrays (2004) (0)
A Powerful Procedure for Proving Practical Propositions (1994) (0)
A Pseudorandom Pulse Communication System (1957) (0)
The Number of Digital Straight Lines O N a N N X N G R I D (0)
Using Mathematical Parentheses in English (2009) (0)
Fast decorrelation algorithm for permutation arrays (1990) (0)
Mathematics after forty years of the space age (1999) (0)
Signal Design for Good Correlation: Correlation of Boolean Functions (2005) (0)
A Consequence of Dirichlet's Theorem: 11109 (2006) (0)
Problems for Solution: 4798-4803 (1958) (0)
Distinct Elements in Non-Commutative Groups and Loops (1963) (0)
More Charades and Mondegreens (2010) (0)
Basic Techniques (2021) (0)
Cyclic Difference Sets and Binary Sequences with Two-Level Autocorrelation (2005) (0)
Some Decompositions of the Integers From 0 to pn — 1 (1972) (0)
A Simple Construction of Almost Perfect Quinary ASK and QAM Sequences (2014) (0)
Generating Functions and Recurrence Relations (2021) (0)
The Meaning of Time (2013) (0)
Cyclic Hadamard Sequences, Part 1 (2005) (0)
Wreaths of Tangent Circles (1981) (0)
The Antiquity of the Dreidle (2011) (0)
When Is Extra-Terrestrial Life Interesting? (1963) (0)
Advanced Problems: 5916-5921 (1973) (0)
Coding for Discrete Noiseless Channels (1994) (0)
On Representing an Integer as the Harmonic Mean of Integers (1973) (0)
Elementary Problems: E3384-E3390 (1990) (0)
Advanced Problems: 6036-6041 (1975) (0)
Martin Gardner and Ticktacktoe (2008) (0)

This paper list is powered by the following services:

Other Resources About Solomon W. Golomb

en.wikipedia.org

What Schools Are Affiliated With Solomon W. Golomb?

Solomon W. Golomb is affiliated with the following schools:

Image Attributions

Image Source for Solomon W. Golomb