Abstract
In this paper, we propose a new method to generate n × n binary matrices for n = ki¾ź2t where k and t are positive integers with a maximum/high of branch numbers and a minimum number of fixed points by using 2t×2t Hadamard almost maximum distance separable matrices and k × k cyclic binary matrix groups. By using the proposed method, we generate n × n for n = 6, 8, 12, 16, and 32 binary matrices with a maximum of branch numbers, which are efficient in software implementations. The proposed method is also applicable with m × m circulant matrices to generate n × nfor n = ki¾źm binary matrices with a maximum/high of branch numbers. For this case, some examples for 16 × 16, 48 × 48, and 64 × 64 binary matrices with branch numbers of 8, 15, and 18, respectively, are presented. Copyright © 2016 John Wiley & Sons, Ltd.
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.
