On an inequivalence criterion for cocyclic Hadamard matrices
From MaRDI portal
Publication:601106
DOI10.1007/s12095-010-0024-0zbMath1225.05053OpenAlexW2086181739MaRDI QIDQ601106
Publication date: 3 November 2010
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle//11441/87412
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cocyclic development of designs
- The homological reduction method for computing cocyclic Hadamard matrices
- A weak difference set construction for higher dimensional designs
- Hadamard equivalence via graph isomorphism
- Erratum to ``Cocyclic development of designs
- A system of equations for describing cocyclic Hadamard matrices
This page was built for publication: On an inequivalence criterion for cocyclic Hadamard matrices