Abstract
A new coding rule based on multiplicative characteristics over GF (p) is identified for the construction of perfect q-ary sequences. A subset of these sequences achieves the maximum possible efficiency less than unity. The new coding rule is illustrated by demonstrating that the perfect ternary Ipatov sequences are incorporated in these perfect q-ary 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 callSimilar Papers
Disclaimer: 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.
