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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Cryptography and communications : discrete structures, Boolean functions and sequences
Paper Title
Journal
Date
