Skip to main content
placeholder image

Counting techniques specifying the existence of submatrices in weighing matrices

Chapter


Abstract


  • Two algorithmic techniques for specifying the existence of a k × k submatrix with elements 0, ±1 in a skew and symmetric conference matrix of order n are described. This specification is achieved using an appropriate computer algebra system. © Springer-Verlag Berlin Heidelberg 2005.

Publication Date


  • 2005

Citation


  • Counting techniques specifying the existence of submatrices in weighing matrices (2005). In Unknown Book (Vol. 3718 LNCS, pp. 294-305). doi:10.1007/11555964_25

International Standard Book Number (isbn) 13


  • 9783540289661

Scopus Eid


  • 2-s2.0-33744921116

Web Of Science Accession Number


Book Title


  • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Start Page


  • 294

End Page


  • 305

Abstract


  • Two algorithmic techniques for specifying the existence of a k × k submatrix with elements 0, ±1 in a skew and symmetric conference matrix of order n are described. This specification is achieved using an appropriate computer algebra system. © Springer-Verlag Berlin Heidelberg 2005.

Publication Date


  • 2005

Citation


  • Counting techniques specifying the existence of submatrices in weighing matrices (2005). In Unknown Book (Vol. 3718 LNCS, pp. 294-305). doi:10.1007/11555964_25

International Standard Book Number (isbn) 13


  • 9783540289661

Scopus Eid


  • 2-s2.0-33744921116

Web Of Science Accession Number


Book Title


  • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Start Page


  • 294

End Page


  • 305