2017
DOI: 10.1007/s10623-017-0429-2
|View full text |Cite
|
Sign up to set email alerts
|

Hadamard full propelinear codes of type Q; rank and kernel

Abstract: Hadamard full propelinear codes (HFP-codes) are introduced and their equivalence with Hadamard groups is proven (on the other hand, it is already known the equivalence of Hadamard groups with relative (4n, 2, 4n, 2n)-difference sets in a group and also with cocyclic Hadamard matrices). We compute the available values for the rank and dimension of the kernel of HFP-codes of type Q and we show that the dimension of the kernel is always 1 or 2. We also show that when the dimension of the kernel is 2 then the dime… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(9 citation statements)
references
References 18 publications
0
9
0
Order By: Relevance
“…The following lemma will be useful in some proofs in the next sections. It is an stronger version of [22,Proposition 6]. Proof.…”
Section: Associated Groupmentioning
confidence: 98%
See 1 more Smart Citation
“…The following lemma will be useful in some proofs in the next sections. It is an stronger version of [22,Proposition 6]. Proof.…”
Section: Associated Groupmentioning
confidence: 98%
“…Proof. In [22,Proposition 6], it is proved that C| s consists of two copies of a Hadamard code of length 2t. As we project the code C over the support of s, we have that s| s = u 2t .…”
Section: Associated Groupmentioning
confidence: 99%
“…Furthermore, C is called full propelinear [15] if the permutation π x has not any fixed coordinate when x = 0, x = 1; and if 1 ∈ C then π 1 = Id n . Definition 2.4.…”
Section: Propelinear Codesmentioning
confidence: 99%
“…A generalized Hadamard code, which is also full propelinear, is called generalized Hadamard full propelinear code (briefly, GHFP-code). In the binary case, we have the Hadamard full propelinear codes, they were introduced in [15] and their equivalence with Hadamard groups was proven.…”
Section: Propelinear Codesmentioning
confidence: 99%
“…The following lemma will be useful in some proofs through the next sections. It is an improved version of a lemma which appears in [22]. Proposition 3.6.…”
Section: Preliminariesmentioning
confidence: 99%