Abstract
We present a novel transform for periodic complementary sets (PCSs) over two-valued alphabets from a large set of difference families. This is achieved by generalizing Golomb's idea in 1992, which was for transformed perfect sequences with zero autocorrelations only. Based on the properties of difference family, a sufficient condition for such two-valued PCSs is derived. Systematic constructions of two-valued periodic complementary pairs are presented. It is shown that many lengths for which binary PCSs do not exist become admissible for our proposed two-valued PCSs.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
