Fast operations for certain two alphabet circulant matrices

Authors

Gene Awyzio, University of WollongongFollow
Jennifer Seberry, University of WollongongFollow

RIS ID

89345

Publication Details

Awyzio, G. & Seberry, J. (2013). Fast operations for certain two alphabet circulant matrices. In H. R. Arabnia, G. A. Gravvanis, G. Jandieri, A. M. G. Solo & F. G. Tinetti (Eds.), Proceedings of the 13th International Conference on Scientific Computing (CSC) (pp. 234-238). United States: CSREA Press.

Abstract

In order to efficiently compute some combinatorial designs based upon circulant matrices which have different, defined numbers of 1's and 0's in each row and column we need to find candidate vectors with differing weights and Hamming distances. This paper concentrates on how to efficiently create such circulant matrices. These circulant matrices have applications in signal processing, public key codes and spectography