Abstract
Hadamard matrix is defined as a square matrix where any components are −1 or +1, and where any pairs of rows are mutually orthogonal. In this work, we consider the similar matrix on finite field GF(p) where p is an odd prime. In such a matrix, every component is one of the integers on GF(p)\{0}, that is, {1, 2, . . . , p–1}. Any additions and multiplications should be executed under modulo p. The author has proposed a method to generate such matrices, and applied them to generate n-shift orthogonal sequences and complete complementary codes. The generated complete complementary code is a family of multi-valued sequences on GF(p)\{0}, where the number of sequence sets, the number of sequences in each sequence set and the sequence length depend on the various divisors of p – 1. Such complete complementary codes with various parameters have not been proposed in previous studies. In this paper, some properties of those matrices are shown to give various construction methods.
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.
