Pasar al contenido principal

CODIGOS CORRECTORES DE ERRORES Y SUS APLICACIONES: COMPLETAMENTE REGULARES Y HADAMARD. SOFTWARE EN TEORIA DE CODIGOS

TIN2016-77918-P

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D (Excelencia / Generación de Conocimiento)
Año convocatoria 2016
Plan Estatal 2013-2016 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): 13
Encontrada(s) 1 página(s)

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

Z2Z4-Additive Cyclic Codes, Kernel and Rank

  • Borges, Joaquim|||0000-0002-5774-4874
  • Dougherty, Steven T.
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Ten-Valls, Roger|||0000-0001-5193-7491
A Z(2)Z(4)-additive code C subset of Z(2)(alpha) x Z(4)(beta) is called cyclic if the set of coordinates can be partitioned into two subsets, the set of Z(2) coordinates and the set of Z(4) coordinates, such that any cyclic shift of the coordinates of both subsets leaves the code invariant. Let Phi(C) be the binary Gray map image of C. We study the rank and the dimension of the kernel of a Z(2)Z(4)-additive cyclic code C, that is, the dimensions of the binary linear codes and ker (Phi(C)). We give upper and lower bounds for these parameters. It is known that the codes and ker(Phi (C)) are binary images of Z(2)Z(4)-additive codes that we denote by R(C) and K(C), respectively. Moreover, we show that R(C) and K(C) are also cyclic and determine the generator polynomials of these codes in terms of the generator polynomials of the code C.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

On hadamard full propelinear codes with associated group C2t × C2

  • Bailera, Ivan|||0000-0001-6772-4802
  • Borges, Joaquim|||0000-0002-5774-4874
  • Rifà, Josep|||0000-0001-9199-4001
We introduce the Hadamard full propelinear codes that factorize as direct product of groups such that their associated group is C2t × C2. We study the rank, the dimension of the kernel, and the structure of these codes. For several specific parameters we establish some links from circulant Hada-mard matrices and the nonexistence of the codes we study. We prove that the dimension of the kernel of these codes is bounded by 3 if the code is nonlinear. We also get an equivalence between circulant complex Hadamard matrix and a type of Hadamard full propelinear code, and we find a new example of circulant complex Hadamard matrix of order 16.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

On completely regular and completely transitive supplementary codes

  • Borges, Joaquim|||0000-0002-5774-4874
  • Rifà, Josep|||0000-0001-9199-4001
  • Zinoviev, Victor|||0000-0002-7639-6115
Given a parity-check matrix Hm of a q-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two codes is the supplementary code of the other one. We obtain that if one of these codes is a Hamming code, then the supplementary code is completely regular and completely transitive. If one of the codes is completely regular with covering radius 2, then the supplementary code is also completely regular with covering radius at most 2. Moreover, in this case, either both codes are completely transitive, or both are not. With this technique, we obtain infinite families of completely regular and completely transitive codes which are quasi-perfect uniformly packed.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Z₂Z₄-additive cyclic codes, generator polynomials, and dual codes

  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Ten-Valls, Roger|||0000-0001-5193-7491
A Z₂Z₄-additive code C ⊆ Zα2 × Zβ₄ is called cyclic code if the set of coordinates can be partitioned into two subsets, the set of Z₂ and the set of Z₄ coordinates, such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be identified as submodules of the Z₄[x]-module Z₂[x]/(x^α - 1) × Z₄ [x]/(x^β - 1). The parameters of a Z₂Z₄-additive cyclic code are stated in terms of the degrees of the generator polynomials of the code. The generator polynomials of the dual code of a Z₂Z₄-additive cyclic code are determined in terms of the generator polynomials of the code C.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Partial permutation decoding for binary linear and Z4-linear Hadamard codes

  • Barrolleta, Roland David|||0000-0002-8792-2571
  • Villanueva, M|||0000-0001-6179-0833
In this paper, s-PD-sets of minimum size s + 1 for partial permutation decoding for the binary linear Hadamard code H_m of length 2^m , for all m ≥ 4 and 2 ≤ s ≤ floor(2^m/(1+m)) -1, are constructed. Moreover, recursive constructions to obtain s-PD-sets of size l ≥ s + 1 for H_{m+1} of length 2^(m+1), from an s-PD-set of the same size for H_m , are also described. These results are generalized to find s-PD-sets for the Z4 -linear Hadamard codes H_{γ,δ} of length 2^m , m = γ + 2δ - 1, which are binary Hadamard codes (not necessarily linear) obtained as the Gray map image of quaternary linear codes of type 2^γ 4^δ . Specifically, s-PD-sets of minimum size s + 1 for H_{γ,δ} , for all δ ≥ 3 and 2 ≤ s ≤ floor(2^(2δ-2)/δ)-1, are constructed and recursive constructions are described.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

About non equivalent completely regular codes with identical intersection array

  • Rifà, Josep|||0000-0001-9199-4001
  • Zinoviev, Victor|||0000-0002-7639-6115
We obtain several classes of completely regular codes with different parameters, but identical intersection array. Given a prime power q and any two natural numbers a, b, we construct completely transitive codes over different fields with covering radius ρ = min{a, b} and identical intersection array, specifically, we construct one code over F_{q^r} for each divisor r of a or b. As a corollary, for any prime power q, we show that distance regular bilinear forms graphs can be obtained as coset graphs from several completely regular codes with different parameters.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Completely regular codes with different parameters giving the same distance-regular coset graphs

  • Rifà, Josep|||0000-0001-9199-4001
  • Zinoviev, Victor|||0000-0002-7639-6115
We construct several classes of completely regular codes with different parameters, but identical intersection array. Given a prime power q and any two natural numbers a,b, we construct completely transitive codes over different fields with covering radius ρ=min{a,b}ρ=min{a,b} and identical intersection array, specifically, one code over F_q^r for each divisor r of a or b. As a corollary, for any prime power qq, we show that distance regular bilinear forms graphs can be obtained as coset graphs from several completely regular codes with different parameters.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Q-ary codes

  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
  • Villanueva, M.|||0000-0001-6179-0833
The research group CCSG (Combinatorics, Coding and Security Group) is one of the research groups in the dEIC (Department of Information and Communications Engineering) at the UAB (Universitat Aut'onoma de Barcelona) in Spain. From 1987 the team CCSG has been uninterruptedly working in several projects and research activities on Information Theory, Communications, Coding Theory, Source Coding, Teledetection, Cryptography, Electronic Voting, e-Auctions, Mobile Agents, etc. The more important know-how of CCSG is about algorithms for forward error correction (FEC), such as Golay codes, Hamming product codes, Reed-Solomon codes, Preparata and Preparata-like codes, (extended) nonlinear 1-perfect codes, Z4-linear codes, Z2Z4-linear codes, etc.; computations of the rank and the dimension of the kernel for nonlinear codes as binary 1-perfect codes, q-ary 1-perfect codes, Preparata codes, Hadamard codes, Kerdock codes, quaternary Reed-Muller codes, etc.; the existence and structural properties for 1-perfect codes, uniformly packed codes, completely regular codes, completely transitive codes, etc.
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 Z2Z4-additive complementary dual codes and related LCD codes

  • Benbelkacem, N.
  • Dougherty, Steven T.
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
Linear complementary dual codes were defined by Massey in 1992, and were used to give an optimum linear coding solution for the two user binary adder channel. In this paper, we define the analog of LCD codes over fields in the ambient space with mixed binary and quaternary alphabets. These codes are additive, in the sense that they are additive subgroups, rather than linear as they are not vector spaces over some finite field. We study the structure of these codes and we use the canonical Gray map from this space to the Hamming space to construct binary LCD codes in certain cases. We give examples of such binary LCD codes which are distance-optimal, i.e., they have the largest minimum distance among all binary LCD codes with the same length and dimension.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Quaternary group ring codes, ranks, kernels and self-dual codes

  • Dougherty, Steven T.
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Ten-Valls, Roger|||0000-0001-5193-7491
  • Yildiz, Bahattin
We study G-codes over the ring Z4, which are codes that are held invariant by the action of an arbitrary group G. We view these codes as ideals in a group ring and we study the rank and kernel of these codes. We use the rank and kernel to study the image of these codes under the Gray map. We study the specific case when the group is the dihedral group and the dicyclic group. Finally, we study quaternary self-dual dihedral and dicyclic codes, tabulating the many good self-dual quaternary codes obtained via these constructions, including the octacode.
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.