Abstract
This paper generalizes a method of generating shift sequences in the interleaved construction proposed by Gong. With the new shift sequences, some new families of p-ary sequences with desired properties can be obtained. A lower bound on the number of new families of binary sequences is also established.
| Original language | English |
|---|---|
| Pages (from-to) | 1305-1319 |
| Number of pages | 15 |
| Journal | Journal of Systems Science and Complexity |
| Volume | 27 |
| Issue number | 6 |
| DOIs | |
| State | Published - 30 Nov 2014 |
| Externally published | Yes |
Keywords
- Auto-correlation
- cross-correlation
- linear complexity
- low correlation
- p-ary sequence
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- Information Systems
Fingerprint
Dive into the research topics of 'Families of p-ary sequences with low correlation and large linear complexity'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver