From post

Calculating Cocyclic Hadamard Matrices in Mathematica: Exhaustive and Heuristic Searches.

, , , и . ICMS, том 4151 из Lecture Notes in Computer Science, стр. 419-422. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

A Genetic Algorithm for Cocyclic Hadamard Matrices., , , и . AAECC, том 3857 из Lecture Notes in Computer Science, стр. 144-153. Springer, (2006)An Algorithm for Computing Cocyclic Matrices Developed over Some Semidirect Products., , , и . AAECC, том 2227 из Lecture Notes in Computer Science, стр. 287-296. Springer, (2001)Calculating Cocyclic Hadamard Matrices in Mathematica: Exhaustive and Heuristic Searches., , , и . ICMS, том 4151 из Lecture Notes in Computer Science, стр. 419-422. Springer, (2006)Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t., , , , и . AAECC, том 5527 из Lecture Notes in Computer Science, стр. 204-214. Springer, (2009)A Mathematica Notebook for Computing the Homology of Iterated Products of Groups., , , и . ICMS, том 4151 из Lecture Notes in Computer Science, стр. 47-57. Springer, (2006)Comparison Maps for Relatively Free Resolutions., , , и . CASC, том 4194 из Lecture Notes in Computer Science, стр. 1-22. Springer, (2006)Generating binary partial Hadamard matrices., , , , , , и . Discret. Appl. Math., (2019)A Heuristic Procedure with Guided Reproduction for Constructing Cocyclic Hadamard Matrices., , и . ICANNGA, том 5495 из Lecture Notes in Computer Science, стр. 150-160. Springer, (2009)GA Based Robust Blind Digital Watermarking., , , , , , и . Electron. Notes Discret. Math., (2018)ACS Searching for D4t-Hadamard Matrices., , , , , , и . ANTS Conference, том 6234 из Lecture Notes in Computer Science, стр. 368-375. Springer, (2010)