#### Filter Results:

#### Publication Year

1980

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Solomon W, S W Golomb
- 2015

Smallest shift register to generate a given sequence: Berlekamp-Massey algorithm. Continued fraction.SHIFT REGISTER SEQUENCES. Goldstein.For other applications of feedback shift registers I recommend the classical book of. Mathematically the sequence aiiN generated.Feedback Shift Register FSR sequences have been successfully implemented. shift register… (More)

1 Summary of the review This is the review of the first edition of the book Signal Design for Good Correlation for Wireless Communication, Cryptography and Radar. The book is written by two well-known researchers with significant contributions to the theory and applications of binary sequences. In 2013, Golomb had received the National Medal of Science for… (More)

- Guang Gong, Solomon W. Golomb
- IEEE Trans. Information Theory
- 1999

DES can be regarded as a nonlinear feedback shift register (NLFSR) with input. From this point of view, the tools for pseudo-random sequence analysis are applied to the S-boxes in DES. The properties of the S-boxes of DES under Fourier transform, Hadamard transform, extended Hadamard transform and Avalanche transform are investigated. Two important results… (More)

- Heekwan Lee, Solomon W. Golomb
- IEEE Transactions on Information Theory
- 2003

In this correspondence, we present a new construction for 64-QAM Golay sequences of length n=2/sup m/ for integer m. The peak envelope power (PEP) of 64-QAM Golay sequences is shown to be bounded by 4.66n. The new construction of 64-QAM Golay sequences of length n=2/sup m/ is based on our earlier construction of new offsets of 16-QAM Golay sequences which… (More)

- Solomon W. Golomb
- IEEE Trans. Information Theory
- 1980

- Guang Gong, Solomon W. Golomb, Hong-Yeop Song
- IEEE Transactions on Information Theory
- 2006

In this correspondence, we present a connection between designing low-correlation zone (LCZ) sequences and the results of correlation of sequences with subfield decompositions presented in a recent book by the first two authors. This results in LCZ signal sets with huge sizes over three different alphabetic sets: finite field of size, integer residue ring… (More)

- Solomon W. Golomb
- J. Comb. Theory, Ser. A
- 1984

- Jong-Seon No, Solomon W. Golomb, Guang Gong, Hwan-Keun Lee, Peter Gaal
- IEEE Trans. Information Theory
- 1998

- Solomon W. Golomb, Guang Gong
- IEEE Transactions on Information Theory
- 2007

The definition, the basic properties, and all the currently known systematic constructions for Costas arrays are presented, as well as a table of the number C(n) of Costas arrays of order n, for 2 les n les 26. It is proved that lim sup<sub>nrarrinfin</sub> C(n) = infin, and the conjecture liminf<sub>nrarrinfin</sub> C(n) = 0 is discussed. A Costas array of… (More)