1. One construction of perfect ternary sequences
- Author
-
Evgeny I. Krengel
- Subjects
Computer Networks and Communications ,Generalization ,Applied Mathematics ,020206 networking & telecommunications ,0102 computer and information sciences ,02 engineering and technology ,01 natural sciences ,Combinatorics ,Computational Theory and Mathematics ,010201 computation theory & mathematics ,0202 electrical engineering, electronic engineering, information engineering ,Special case ,Ternary operation ,Mathematics - Abstract
We present a new construction of a family of perfect ternary sequences (PTSs) that is a generalization of one of the known families of PTSs. These PTSs of length N1N2 are derived from shift sequences of odd length N1 corresponding to m-sequences over GF(p) and PTSs of odd length N2. Ipatov PTSs are a special case where N2 = 1. For N2 ≥ 3, we find conditions under which the obtained PTSs are new. We also consider implementation issues of these sequences.
- Published
- 2019