Skip to main content

CODIGOS CORRECTORES DE ERRORES Y SUS APLICACIONES: ALMACENAJE DISTRIBUIDO Y COMPUTACION CUANTICA. SOFTWARE EN TEORIA DE CODIGOS

PID2019-104664GB-I00

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2019
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD AUTONOMA DE BARCELONA

Resultados relacionados

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

Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Butson full propelinear codes

  • Armario, José Andrés
  • Bailera, Ivan
  • Egan, Ronan
In this paper we study Butson Hadamard matrices, and codes over finite rings coming from these matrices in logarithmic form, called BH-codes. We introduce a new morphism of Butson Hadamard matrices through a generalized Gray map on the matrices in logarithmic form, which is comparable to the morphism given in a recent note of Ó Catháin and Swartz. That is, we show how, if given a Butson Hadamard matrix over the kth roots of unity, we can construct a larger Butson matrix over the ℓth roots of unity for any ℓ dividing k, provided that any prime p dividing k also divides ℓ. We prove that a Zps-additive code with p a prime number is isomorphic as a group to a BH-code over Zps and the image of this BH-code under the Gray map is a BH-code over Zp (binary Hadamard code for p=2). Further, we investigate the inherent propelinear structure of these codes (and their images) when the Butson matrix is cocyclic. Some structural properties of these codes are studied and examples are provided.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Rank and kernel of additive generalised Hadamard codes

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

On LCD, self dual and isodual cyclic codes over finite chain rings

  • Benyettou, Amel
  • Batoul, Aicha
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
In this paper, LCD cyclic, self dual and isodual codes over finite chain rings are investigated. It was proven recently that a non-free LCD cyclic code does not exist over finite chain rings. Based on algebraic number theory, we introduce necessary and sufficient conditions for which all free cyclic codes over a finite chain ring are LCD. We have also obtained conditions on the existence of non trivial self dual cyclic codes of any length when the nilpotency index of the maximal ideal of a finite chain ring is even. Further, several constructions of isodual codes are given based on the factorization of the polynomial x-1 over a finite chain ring.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

On the linearity and classification of Z_p^s-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
Zp^s-additive codes of length n are subgroups of (Zp^s)^n , and can be seen as a generalization of linear codes over Z2, Z4 , or Z2^s in general. A Zp^s-linear generalized Hadamard (GH) code is a GH code over Zp which is the image of a Zp^s-additive code by a generalized Gray map. In this paper, we generalize some known results for Zp^s-linear GH codes with p = 2 to any odd prime p. First, we show some results related to the generalized Carlet's Gray map. Then, by using an iterative construction of Zp^s -additive GH codes of type (n; t 1 , . . . , t s ), we show for which types the corresponding Zp^s-linear GH codes of length p^t are nonlinear over Zp .For these codes, we compute the kernel and its dimension, which allow us to give a partial classification. The obtained results for p ≥ 3 are different from the case with p = 2. Finally, the exact number of non-equivalent such codes is given for an infinite number of values of s, t, and any p ≥ 2; by using also the rank as an invariant in some specific cases.
Dipòsit Digital de Documents de la UAB
Publication 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
Publication 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
Publication 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.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Partial permutation decoding and PD-sets for Zps-linear generalized Hadamard codes

  • Torres Martín, Adrián|||0000-0002-2489-8930
  • Villanueva, M|||0000-0001-6179-0833
It is known that Zps-linear codes, which are the Gray map image of Zps-additive codes (linear codes over Zps), are systematic and a systematic encoding has been found. This makes Zps-linear codes suitable to apply the permutation decoding method. This technique is also based on the existence of r-PD-sets, which are subsets of the permutation automorphism group of the code. In this paper, we study the permutation automorphism group of Zps-linear generalized Hadamard codes of type (n;t1,…,ts) and show how to construct r-PD-sets of size r + 1, for all r up to an upper bound, in order to be able to perform a partial permutation decoding for these codes.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

On new infinite families of completely regular and completely transitive codes

  • Borges, Joaquim|||0000-0002-5774-4874
  • Rifà, Josep|||0000-0001-9199-4001
  • Zinoviev, Victor|||0000-0002-7639-6115
In two previous papers we constructed new families of completely regular codes by concatenation methods. Here we determine cases in which the new codes are completely transitive. For these cases we also find the automorphism groups of such codes. For the remaining cases, we show that the codes are not completely transitive assuming an upper bound on the order of the monomial automorphism groups, according to computational results.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Computing Efficiently a Parity-Check Matrix for Zps-Additive Codes

  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Torres Martín, Adrián|||0000-0002-2489-8930
  • Vela, Carlos|||0000-0003-3362-8817
  • Villanueva, M|||0000-0001-6179-0833
The Zps-additive codes of length n are subgroups of Znps, with p prime and s ≥ 1 . They can be seen as a generalization of linear codes over Z2, Z4, or more general over Z2s. In this paper, we show two methods for computing a parity-check matrix of a Zps-additive code from a generator matrix of the code in standard form. We also compare the performance of our results implemented in Magma with the current available function in Magma for linear codes over finite rings in general. Complementing this comparison, we also show a time complexity analysis of the algorithms. The rings Zps belong to a more general class of rings: finite chain rings. Along the paper, we observe that the same results can be applied to any linear code over a finite commutative chain ring.