S. W. Golomb

864 total citations
23 papers, 506 citations indexed

About

S. W. Golomb is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Computational Theory and Mathematics. According to data from OpenAlex, S. W. Golomb has authored 23 papers receiving a total of 506 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Artificial Intelligence, 8 papers in Electrical and Electronic Engineering and 7 papers in Computational Theory and Mathematics. Recurrent topics in S. W. Golomb's work include graph theory and CDMA systems (7 papers), Coding theory and cryptography (7 papers) and Mathematics and Applications (3 papers). S. W. Golomb is often cited by papers focused on graph theory and CDMA systems (7 papers), Coding theory and cryptography (7 papers) and Mathematics and Applications (3 papers). S. W. Golomb collaborates with scholars based in United States and Israel. S. W. Golomb's co-authors include L. R. Welch, Basil Gordon, Hong‐Yeop Song, Marshall Hall, L. D. Baumert, Hansjakob Seiler, Rolf Sattler, Gunther S. Stent, M. Delbrück and David E. Presti and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Transactions on Aerospace and Electronic Systems and Taxon.

In The Last Decade

S. W. Golomb

23 papers receiving 452 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
S. W. Golomb United States	10	200	163	146	98	58	23	506
František Matúš Czechia	14	241 1.2×	223 1.4×	189 1.3×	30 0.3×	139 2.4×	40	539
John B. Fraleigh	3	90 0.5×	113 0.7×	56 0.4×	27 0.3×	57 1.0×	7	414
Prasoon Tiwari United States	12	279 1.4×	184 1.1×	56 0.4×	29 0.3×	183 3.2×	25	597
Raphael M. Robinson United States	15	509 2.5×	187 1.1×	62 0.4×	117 1.2×	28 0.5×	62	904
R. G. Stanton Canada	18	154 0.8×	248 1.5×	336 2.3×	31 0.3×	108 1.9×	54	693
Dominic Welsh United Kingdom	8	93 0.5×	144 0.9×	56 0.4×	27 0.3×	52 0.9×	11	339
Michael J. Dinneen New Zealand	15	413 2.1×	361 2.2×	96 0.7×	133 1.4×	178 3.1×	80	791
Harold Fredricksen United States	11	346 1.7×	428 2.6×	222 1.5×	61 0.6×	57 1.0×	17	611
Sherman K. Stein United States	17	446 2.2×	218 1.3×	335 2.3×	70 0.7×	54 0.9×	86	1.1k
David A. Klarner United States	15	295 1.5×	111 0.7×	43 0.3×	42 0.4×	21 0.4×	46	685

Countries citing papers authored by S. W. Golomb

Since Specialization

Citations

This map shows the geographic impact of S. W. Golomb's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by S. W. Golomb with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites S. W. Golomb more than expected).

Fields of papers citing papers by S. W. Golomb

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by S. W. Golomb. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by S. W. Golomb. The network helps show where S. W. Golomb may publish in the future.

Co-authorship network of co-authors of S. W. Golomb

This figure shows the co-authorship network connecting the top 25 collaborators of S. W. Golomb. A scholar is included among the top collaborators of S. W. Golomb based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with S. W. Golomb. S. W. Golomb is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Golomb, S. W., et al.. (2007). There Are No Further Counterexamples to S. Piccard's Theorem. IEEE Transactions on Information Theory. 53(8). 2864–2867. 6 indexed citations

Golomb, S. W.. (2006). On the Classification of Cyclic Hadamard Sequences. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. E89-A(9). 2247–2253. 3 indexed citations

Moreno, Óscar, S. W. Golomb, & S.V. Marić. (2003). Costas sequences for multiple targets. 242–242. 1 indexed citations

Golomb, S. W.. (2002). Shift-register sequences and spread-spectrum communications. 14–15. 12 indexed citations

Song, Hong‐Yeop & S. W. Golomb. (1994). Some new constructions for simplex codes. IEEE Transactions on Information Theory. 40(2). 504–507. 9 indexed citations

Song, Hong‐Yeop & S. W. Golomb. (1994). On the existence of cyclic Hadamard difference sets. IEEE Transactions on Information Theory. 40(4). 1266–1268. 22 indexed citations

Song, Hong‐Yeop & S. W. Golomb. (1993). On the nonperiodic cyclic equivalence classes of Reed-Solomon codes. IEEE Transactions on Information Theory. 39(4). 1431–1434. 22 indexed citations

Song, Hong‐Yeop, Herbert Taylor, & S. W. Golomb. (1992). Progressions in every two-coloration of Zn. Journal of Combinatorial Theory Series A. 61(2). 211–221. 2 indexed citations

Gottesman, Stephen R., P. G. Grieve, & S. W. Golomb. (1992). A class of pseudonoise-like pulse compression codes. IEEE Transactions on Aerospace and Electronic Systems. 28(2). 355–362. 6 indexed citations

10.

Sattler, Rolf, M. Delbrück, Gunther S. Stent, et al.. (1987). Mind from Matter? An Essay on Evolutionary Epistemology. Taxon. 36(2). 529–529. 20 indexed citations

11.

Golomb, S. W., et al.. (1983). On the characteristics of PN sequences (Corresp.). IEEE Transactions on Information Theory. 29(4). 600–600. 8 indexed citations

12.

Golomb, S. W. & A. Lempel. (1977). Second Order Polynomial Recursions. SIAM Journal on Applied Mathematics. 33(4). 587–592. 2 indexed citations

13.

Golomb, S. W.. (1974). A Direct Interpretation of Gandhi's Formula. American Mathematical Monthly. 81(7). 752–754. 6 indexed citations

14.

Cohn, M., Shimon Even, S. W. Golomb, & A. Lempel. (1971). The Stability of Counting Sequences Under Stage Delays. SIAM Journal on Applied Mathematics. 20(2). 183–188. 1 indexed citations

15.

Golomb, S. W.. (1970). Powerful Numbers. American Mathematical Monthly. 77(8). 848–852. 10 indexed citations

16.

Golomb, S. W.. (1968). New Proof of a Classic Combinatorial Theorem. American Mathematical Monthly. 75(5). 530–530. 1 indexed citations

17.

Baumert, L. D., S. W. Golomb, & Marshall Hall. (1962). Discovery of an Hadamard matrix of order 92. Bulletin of the American Mathematical Society. 68(3). 237–238. 42 indexed citations

18.

Golomb, S. W., Basil Gordon, & L. R. Welch. (1958). Comma-Free Codes. Canadian Journal of Mathematics. 10. 202–209. 157 indexed citations

19.

Golomb, S. W.. (1954). Checker Boards and Polyominoes. American Mathematical Monthly. 61(10). 675–682. 85 indexed citations

20.

Golomb, S. W.. (1954). Checker Boards and Polyominoes. American Mathematical Monthly. 61(10). 675–675. 34 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact