Perfect <i>q</i> -ary sequences from multiplicative characters over GF ( <i>p</i> )

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-ary sequences.