Skip to main content

Resultados relacionados

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

RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

A construction of primitive polynomials over finite fields

  • Cardell, Sara D.
  • Climent, Joan-Josep
  • Climent, Joan-Josep|||/items/e5ad2c13-73d7-48cd-a8a0-c74efa487a1c
In this work, a new construction based on companion matrices of primitive polynomials is provided. Given two primitive polynomials over the finite fields Fq and Fqb, we construct a ring isomorphism that transforms the companion matrix of the primitive polynomial over Fqb into a matrix with elements in Fq whose characteristic polynomial is another primitive polynomial over Fq.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Boolean differential operators

  • Hernández Encinas, Luis
  • Martín del Rey, Ángel
18 páginas, 1 tabla, In this work the notion of boolean differential operator is revisited and some new properties are stated. The theoretical results are illustrated with several examples., We would like to thank the anonymous referee for his/her valuable suggestions and comments to improve the original manuscript. This work has been supported by Ministry of Economy and Competitiveness (Spain) and European FEDER Fund under projects TIN2014-55325-C2-1-R, TIN2014-55325-C2-2-R, and MTM2015-69138-REDT.
Dipòsit Digital de Documents de la UAB
Publication

Linear and cyclic codes over direct product of finite chain rings

  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Ten-Valls, Roger|||0000-0001-5193-7491
We introduce a new type of linear and cyclic codes. These codes are defined over a direct product of two finite chain rings. The definition of these codes as certain submodules of the direct product of copies of these rings is given and the cyclic property is defined. Cyclic codes can be seen as submodules of the direct product of polynomial rings. Generator matrices for linear codes and generator polynomials for cyclic codes are determined.
Dipòsit Digital de Documents de la UAB
Publication 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
Publication 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
Publication 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.