Abstract
A new, general method is presented to determine the equivalent linear span (ELS) of binary sequences having an interleaved or related structure. The method is based on a polynomial representation of the interleaved sequences followed by the use of the Euclid algorithm for factorisation, to yield a minimal polynomial. The degree of this minimal polynomial can be identified as the required ELS value. The method is then used here to show that the ELS values of the so-called m-like sequences and the prime and relative prime interleaved sequences, proposed recently by the authors, are quite large and compare favourably with those of the bent function sequences.
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.
