On an inequivalence criterion for cocyclic Hadamard matrices

Given two Hadamard matrices of the same order, it can be quite difficult to decide whether or not they are equivalent. There are some criteria to determine Hadamard inequivalence. Among them, one of the most commonly used is the 4-profile criterion. In this paper, a reformulation of this criterion i...

Descripción completa

Detalles Bibliográficos
Autor: Armario Sampalo, José Andrés
Tipo de recurso: artículo
Estado:Versión enviada para evaluación y publicación
Fecha de publicación:2010
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/87412
Acceso en línea:https://hdl.handle.net/11441/87412
https://doi.org/10.1007/s12095-010-0024-0
Access Level:acceso abierto
Palabra clave:Cocyclic Hadamard matrices
Hadamard equivalence
4-profile criterion
id ES_774ffb7fa4e6166fa4b9a7ab240d9712
oai_identifier_str oai:idus.us.es:11441/87412
network_acronym_str ES
network_name_str España
repository_id_str
spelling On an inequivalence criterion for cocyclic Hadamard matricesArmario Sampalo, José AndrésCocyclic Hadamard matricesHadamard equivalence4-profile criterionGiven two Hadamard matrices of the same order, it can be quite difficult to decide whether or not they are equivalent. There are some criteria to determine Hadamard inequivalence. Among them, one of the most commonly used is the 4-profile criterion. In this paper, a reformulation of this criterion in the cocyclic framework is given. The improvements obtained in the computation of the 4-profile of a cocyclic Hadamard matrix are indicated.Ministerio de Ciencia e Innovación MTM2008-06578Junta de Andalucía FQM–296Junta de Andalucía P07-FQM-02980SpringerMatemática Aplicada I2010info:eu-repo/semantics/articleinfo:eu-repo/semantics/submittedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/87412https://doi.org/10.1007/s12095-010-0024-0reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésCryptography and Communications, 2 (2), 247-259.MTM2008-06578FQM-296P07-FQM-02980https://link.springer.com/article/10.1007/s12095-010-0024-0info:eu-repo/semantics/openAccessoai:idus.us.es:11441/874122026-06-17T12:51:07Z
dc.title.none.fl_str_mv On an inequivalence criterion for cocyclic Hadamard matrices
title On an inequivalence criterion for cocyclic Hadamard matrices
spellingShingle On an inequivalence criterion for cocyclic Hadamard matrices
Armario Sampalo, José Andrés
Cocyclic Hadamard matrices
Hadamard equivalence
4-profile criterion
title_short On an inequivalence criterion for cocyclic Hadamard matrices
title_full On an inequivalence criterion for cocyclic Hadamard matrices
title_fullStr On an inequivalence criterion for cocyclic Hadamard matrices
title_full_unstemmed On an inequivalence criterion for cocyclic Hadamard matrices
title_sort On an inequivalence criterion for cocyclic Hadamard matrices
dc.creator.none.fl_str_mv Armario Sampalo, José Andrés
author Armario Sampalo, José Andrés
author_facet Armario Sampalo, José Andrés
author_role author
dc.contributor.none.fl_str_mv Matemática Aplicada I
dc.subject.none.fl_str_mv Cocyclic Hadamard matrices
Hadamard equivalence
4-profile criterion
topic Cocyclic Hadamard matrices
Hadamard equivalence
4-profile criterion
description Given two Hadamard matrices of the same order, it can be quite difficult to decide whether or not they are equivalent. There are some criteria to determine Hadamard inequivalence. Among them, one of the most commonly used is the 4-profile criterion. In this paper, a reformulation of this criterion in the cocyclic framework is given. The improvements obtained in the computation of the 4-profile of a cocyclic Hadamard matrix are indicated.
publishDate 2010
dc.date.none.fl_str_mv 2010
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/submittedVersion
format article
status_str submittedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/87412
https://doi.org/10.1007/s12095-010-0024-0
url https://hdl.handle.net/11441/87412
https://doi.org/10.1007/s12095-010-0024-0
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Cryptography and Communications, 2 (2), 247-259.
MTM2008-06578
FQM-296
P07-FQM-02980
https://link.springer.com/article/10.1007/s12095-010-0024-0
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869411113546809344
score 15,300724

Similares en LA Referencia