Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Equivalences among Z2s -linear Hadamard codes

  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Vela, Carlos|||0000-0003-3362-8817
  • Villanueva, M|||0000-0001-6179-0833
The Z2s -additive codes are subgroups of Z2s n, and can be seen as a generalization of linear codes over Z2 and Z4. A Z2s -linear Hadamard code is a binary Hadamard code which is the Gray map image of a Z2s -additive code. A partial classification of these codes by using the dimension of the kernel is known. In this paper, we establish that some Z2s -linear Hadamard codes of length 2t are equivalent, once t is fixed. This allows us to improve the known upper bounds for the number of such nonequivalent codes. Moreover, up to t=11, this new upper bound coincides with a known lower bound (based on the rank and dimension of the kernel). Finally, when we focus on s∈{2,3}, the full classification of the Z2s -linear Hadamard codes of length 2t is established by giving the exact number of such codes.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

On Z8-linear Hadamard codes, rank and classification

  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Vela, Carlos|||0000-0003-3362-8817
  • Villanueva, M|||0000-0001-6179-0833
The Z2s -additive codes are subgroups of ZZn2s, and can be seen as a generalization of linear codes over Z2 and Z4. A Zs-linear Hadamard code is a binary Hadamard code which is the Gray map image of a Zs -additive code. It is known that either the rank or the dimension of the kernel can be used to give a complete classification for the Z4-linear Hadamard codes. However, when s > 2, the dimension of the kernel of Z2s-linear Hadamard codes of length 2t only provides a complete classification for some values of t and s. In this paper, the rank of these codes is computed for s=3. Moreover, it is proved that this invariant, along with the dimension of the kernel, provides a complete classification, once t ≥ 3 is fixed. In this case, the number of nonequivalent such codes is also established.