Pasar al contenido principal

Resultados relacionados

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

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

Foundations of additive codes over finite fields

  • Bhunia, Dipak Kumar|||0000-0003-4852-8739
  • Dougherty, Steven T.
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Villanueva, M|||0000-0001-6179-0833
Additive codes were initially introduced by Delsarte in 1973 within the context of association schemes and recently they have become of interest due to their application in constructing quantum error-correcting codes. We give foundational results for additive codes where the elements are from a finite field, and d fine the orthogonality relation using group characters. We introduce a type for these additive codes and explore the notion of independence for a generating set. Additionally, we provide a definition for a generator matrix of an additive code based on its type. We also relate the type of an additive code to the type of its orthogonal. We study a family of kernels and ranks associated with these additive codes. We relate the equivalence of additive codes to their type, the family of kernels and ranks, and duality. We see how these relations contribute in the class fication of additive codes. Finally, we provide a general encoding and decoding method for these codes.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Linearity and classification of Z2Z4Z8-linear Hadamard codes

  • Bhunia, Dipak Kumar|||0000-0003-4852-8739
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Villanueva, M.|||0000-0001-6179-0833
The Z2Z4Z8-additive codes are subgroups of Z2α1 × Z4α2 × Z8α3. A Z2Z4Z8-linear Hadamard code is a Hadamard code which is the Gray map image of a Z2Z4Z8-additive code. A recursive construction of Z2Z4Z8-additive Hadamard codes of type (α1, α2, α3; t1, t2, t3) with α1 ≠ 0, α2 ≠ 0, α3 ≠ 0, t1 ≥ 1, t2 ≥ 0, and t3 ≥ 1 is known. In this paper, we generalize some known results for Z2Z4-linear Hadamard codes to Z2Z4Z8-linear Hadamard codes with α1 ≠ 0, α2 ≠ 0, and α3 ≠ 0. First, we show for which types the corresponding Z2Z4Z8-linear Hadamard codes of length 2t are nonlinear. For these codes, we compute the kernel and its dimension, which allows us to give a partial classification of these codes. Moreover, for 3 ≤ t ≤ 11, we give a complete classification by providing the exact amount of nonequivalent such codes. We also prove the existence of several families of infinite such nonlinear Z2Z4Z8-linear Hadamard codes, which are not equivalent to any other constructed Z2Z4Z8-linear Hadamard code, nor to any Z2Z4-linear Hadamard code, nor to any previously constructed Z2s-linear Hadamard code with s ≥ 2, with the same length 2t.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

On the constructions of ZpZp2-linear generalized Hadamard codes

  • Bhunia, Dipak Kumar|||0000-0003-4852-8739
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Villanueva, M|||0000-0001-6179-0833
The ZZ-additive codes are subgroups of Z ×Z , and can be seen as linear codes over Z when α=0, Z-additive codes when α=0, or ZZ-additive codes when p=2. A ZZ-linear generalized Hadamard (GH) code is a GH code over Z which is the Gray map image of a ZZ-additive code. In this paper, we generalize some known results for ZZ-linear GH codes with p=2 to any p≥3 prime when α≠0. First, we give a recursive construction of ZZ-additive GH codes of type (α,α;t,t) with t,t≥1. We also present many different recursive constructions of ZZ-additive GH codes having the same type, and show that we obtain permutation equivalent codes after applying the Gray map. Finally, according to some computational results, we see that, unlike Z-linear GH codes, when p≥3 prime, the Z-linear GH codes are not included in the family of ZZ-linear GH codes with α≠0. Indeed, we observe that the constructed codes are not equivalent to the Z-linear GH codes for any s≥2.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

On recursive constructions of Z2Z4Z8-linear Hadamard codes

  • Bhunia, Dipak Kumar|||0000-0003-4852-8739
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Villanueva, M|||0000-0001-6179-0833
The Z2Z4Z8-additive codes are subgroups of Z α1 2 × Z α2 4 × Z α3 8 . A Z2Z4Z8-linear Hadamard code is a Hadamard code, which is the Gray map image of a Z2Z4Z8-additive code. In this paper, we generalize some known results for Z2Z4-linear Hadamard codes to Z2Z4Z8-linear Hadamard codes with α1 ̸= 0, α2 ̸= 0, and α3 ̸= 0. First, we give a recursive construction of Z2Z4Z8- additive Hadamard codes of type (α1, α2, α3;t1, t2, t3) with t1 ≥ 1, t2 ≥ 0, and t3 ≥ 1. It is known that each Z4-linear Hadamard code is equivalent to a Z2Z4-linear Hadamard code with α1 ̸= 0 and α2 ̸= 0. Unlike Z2Z4-linear Hadamard codes, in general, this family of Z2Z4Z8-linear Hadamard codes does not include the family of Z4-linear or Z8-linear Hadamard codes. We show that, for example, for length 211, the constructed nonlinear Z2Z4Z8-linear Hadamard codes are not equivalent to each other, nor to any Z2Z4-linear Hadamard, nor to any previously constructed Z2s -Hadamard code, with s ≥ 2. Finally, we also present other recursive constructions of Z2Z4Z8-additive Hadamard codes having the same type, and we show that, after applying the Gray map, the codes obtained are equivalent to the previous ones.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

On the equivalence of Z ps -linear generalized Hadamard codes

  • Bhunia, Dipak Kumar|||0000-0003-4852-8739
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Vela, Carlos|||0000-0003-3362-8817
  • Villanueva, M|||0000-0001-6179-0833
Linear codes of length n over Zps , p prime, called Zps -additive codes, can be seen as subgroups of Zn ps . A Zps -linear generalized Hadamard (GH) code is a GH code over Zp which is the image of a Zps -additive code under a generalized Gray map. It is known that the dimension of the kernel allows to classify these codes partially and to establish some lower and upper bounds on the number of such codes. Indeed, in this paper, for p ≥ 3 prime, we establish that some Zps -linear GH codes of length pt having the same dimension of the kernel are equivalent to each other, once t is fixed. This allows us to improve the known upper bounds. Moreover, up to t = 10 if p = 3 or t = 8 if p = 5, this new upper bound coincides with a known lower bound based on the rank and dimension of the kernel.