Solomon W. Golomb

From Infogalactic: the planetary knowledge core
Jump to: navigation, search

Lua error in package.lua at line 80: module 'strict' not found.

Solomon W. Golomb
Born (1932-05-30) May 30, 1932 (age 91)
Baltimore, Maryland
Nationality American
Fields Mathematics, engineering
Institutions University of Southern California
Alma mater Harvard University
Doctoral advisor David Widder
Doctoral students Hal Fredricksen
Notable awards Claude E. Shannon Award (1985)
IEEE Richard W. Hamming Medal (2000)
National Medal of Science (2011)

Solomon Wolf Golomb (born May 30, 1932) is 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 and coined the name. He also fully described polyominoes and pentominoes in 1953.[1][2] He has specialized in problems of combinatorial analysis, number theory, coding theory and communications. His game of pentomino inspired Tetris.

Academic achievements

Golomb, a graduate of the Baltimore City College high school, received his bachelor's degree from Johns Hopkins University and master's and doctorate degree in mathematics from Harvard University in 1957 with a dissertation on "Problems in the Distribution of the Prime Numbers".

While working at the Glenn L. Martin Company he became interested in communications theory and began his work on shift register sequences. He spent his Fulbright year at the University of Oslo and then joined the Jet Propulsion Laboratory at Caltech, where he researched military and space communications. He joined the faculty of USC in 1963 and was awarded full tenure two years later.

Golomb pioneered the identification of the characteristics and merits of maximum length shift register sequences, also known as pseudorandom or pseudonoise sequences, which have extensive military, industrial and consumer applications. Today, millions of cordless and cellular phones employ pseudorandom direct-sequence spread spectrum implemented with shift register sequences. His efforts made USC a center for communications research.

Golomb was the inventor of Golomb coding, a form of entropy encoding. Golomb rulers, used in astronomy and in data encryption, are also named for him, as is one of the main generation techniques of Costas arrays, the Lempel-Golomb generation method.

He is a regular columnist, writing Golomb's Puzzle Column in the IEEE Information Society Newsletter. He was also a frequent contributor to Scientific American's Mathematical Games column. Among his contributions to recreational mathematics are Rep-tiles. He also contributes a puzzle to each issue of the Johns Hopkins Magazine, a monthly publication of his undergraduate alma mater, for a column called "Golomb's Gambits", and is a frequent contributor to Word Ways: The Journal of Recreational Linguistics.[3]


Golomb is a member of both the National Academy of Engineering and the National Academy of Science.

In 1985 he received the Shannon Award of the Information Theory Society of the IEEE.

In 1992, he received the medal of the U.S. National Security Agency for his research, and has also been the recipient of the Lomonosov Medal of the Russian Academy of Science and the Kapitsa Medal of the Russian Academy of Natural Sciences.

In 2000 he was awarded the IEEE Richard W. Hamming Medal for his exceptional contributions to information sciences and systems.[4] He was singled out as a major figure of coding and information theory for over four decades, specifically for his ability to apply advanced mathematics to problems in digital communications.

Golomb was one of the first high profile professors to attempt the Ronald K. Hoeflin Mega IQ power test, which originally appeared in Omni Magazine. He scored at least IQ 176, which represents ​11,000,000 of the unselected population.

In 2012, he became a fellow of the American Mathematical Society.[5] That same year, it was announced that he had been selected to receive the National Medal of Science.[6] In 2014 he was elected as a fellow of the Society for Industrial and Applied Mathematics "for contributions to coding theory, data encryption, communications, and mathematical games."[7]

Selected books

See also


External links