Title :
Perfect q-ary sequences from multiplicative characters over GF(p)
Author_Institution :
Sandia Nat. Labs., Albuquerque, NM, USA
fDate :
4/23/1992 12:00:00 AM
Abstract :
A new coding rule based on multiplicative characteristics over GF(p) is identified for the construction of perfect q-ary sequences. A subset of these sequences achieves the maximum possible efficiency less than unity. The new coding rule is illustrated by demonstrating that the perfect ternary Ipatov sequences are incorporated in these perfect q-art sequences.
Keywords :
binary sequences; correlation theory; encoding; coding rule; maximum possible efficiency; multiplicative characters; perfect periodic autocorrelation; perfect q-ary sequences; perfect ternary Ipatov sequences; ternary sequences;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19920527
