Pasar al contenido principal

CODIGOS OPTIMOS CORRECTORES DE ERRORES Y SUS APLICACIONES. SOFTWARE EN TEORIA DE CODIGOS

PID2022-137924NB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2022
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD AUTONOMA DE BARCELONA

Resultados relacionados

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

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

Improving explicit constructions of r-PD-sets for Zps-linear generalized Hadamard codes

  • Rifà, Josep|||0000-0001-9199-4001
  • 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, based on the existence of r-PD-sets, which are subsets of the permutation automorphism group of the code. Some constructions of r-PD-sets of minimum size r + 1 for Zps -linear generalized Hadamard codes of type (n;t1, . . . , ts) are known. In this paper, for these codes, we present new constructions of r-PD-sets of size r + 1, which are suitable for all parameters t1, . . . , ts. These allow us to obtain new r-PD-sets for values of r closer to the theoretical upper bound, improving previous known results.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

On self-dual completely regular codes with covering radius ρ ≤ 3

  • Borges, Joaquim|||0000-0002-5774-4874
  • Zinoviev, Victor|||0000-0002-7639-6115
We give a complete classification of self-dual completely regular codes with covering radius ρ ≤ 3. For ρ = 1 the results are almost trivial. For ρ = 2, by using properties of the more general class of uniformly packed codes in the wide sense, we show that there are two sporadic such codes, of length 8, and an infinite family, of length 4, apart from the direct sum of two self-dual completely regular codes with ρ = 1, each one. For ρ = 3, in some cases, we use similar techniques to the ones used for ρ = 2. However, for some other cases we use different methods, namely, the Pless power moments which allow to us to discard several possibilities. We show that there are only two self-dual completely regular codes with ρ = 3 and d ≥ 3, which are both ternary: the extended ternary Golay code and the direct sum of three ternary Hamming codes of length 4. Therefore, any self-dual completely regular code with d ≥ 3 and ρ = 3 is ternary and has length 12. We provide the intersection arrays for all such codes.
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)

Cyclic completely regular codes C1,5

  • Rifà, Josep|||0000-0001-9199-4001
  • Zinoviev, Victor|||0000-0002-7639-6115
We construct a family of cyclic completely regular codes (CRCs) of length n=2m-1 and compute their intersection arrays. These codes, denoted C1,5, are generated by the product m1(x)m5(x), where mi(x) is the minimal polynomial of αi, and α is a primitive element of the finite field F2m. We consider two main cases: odd m and m≡2(mod4). For odd m, these codes are known to be completely regular with covering radius ρ=3 and minimum distance d=5. We prove that, for any m, the codes C1,3 and C1,5 are non-equivalent despite sharing the same parameters and intersection array. For m≡2(mod4), we demonstrate that C1,5 forms a new family of completely regular codes with covering radius ρ=3, minimum distance d=3, and intersection array IA=[n,n-3,3n+74;1,4,n-34]. Moreover, the corresponding extended cyclic codes C1,5∗ are completely regular [n+1,n-2m,4;4]-codes with intersection array IA=[n+1,n,n-3,3n+74;1,4,n-34,n+1]. We also describe the parameters and some properties of the coset graphs associated to these completely regular codes which form distance-regular graphs.
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.
Dipòsit Digital de Documents de la UAB
Publicación 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
Publicación 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
Publicación 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.