Abstract
A class of periodic binary sequences that are obtained from q-ary m-sequences is defined, and a general method to determine their linear spans (the length of the shortest linear recursion over the Galois field GF(2) satisfied by the sequence) is described. The results imply that the binary sequences under consideration have linear spans that are comparable with their periods, which can be made very long. One application of the results shows that the projective and affine hyperplane sequences of odd order both have full linear span. Another application involves the parity sequence of order n, which has period p/sup m/-1, where p is an odd prime. The linear span of a parity sequence of order n is determined in terms of the linear span of a parity sequence of order 1, and this leads to an interesting open problem involving primes. >
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.
