• Aucun résultat trouvé

Double Cyclic Codes Over the Rings Z

N/A
N/A
Protected

Academic year: 2022

Partager "Double Cyclic Codes Over the Rings Z"

Copied!
1
0
0

Texte intégral

(1)

Double Cyclic Codes Over the Rings Z α 2 × Z β 2 and Z α 2 × Z β 4

Joaquim Borges Ayats

Department of Information and Communication Engineering Universitat Aut` onoma de Barcelona

08193-Bellaterra, Spain Cristina Fern´ andez-C´ ordoba

Department of Information and Communication Engineering Universitat Aut` onoma de Barcelona

08193-Bellaterra, Spain and

Roger Ten-Valls

Department of Information and Communication Engineering Universitat Aut` onoma de Barcelona

08193-Bellaterra, Spain November 19, 2014

Abstract

Consider the rings R1 and R2, such that R1 is an R2-module, and C ⊂ Rα1 ×R2β an additive code. The code C is a double cyclic code if the set of coordinates can be partitioned into two subsets, the set of coordinates inR1 and the set of coordinates in R2, such that any cyclic shift of the coordinates of both subsets leaves invariant the code. The code can be identified as submodules of theR2[x]-moduleR1[x]/(xα− 1)×R2[x]/(xβ −1). We define two cases. First, when the code C is binary, that is R1 = R2 = Z2, which is called Z2-double cyclic. The second case is whenR1 =Z2 and R2 =Z4, that is the code is aZ2Z4- additive code, and it is calledZ2Z4-cyclic. In both cases, we determine the structure of these double cyclic codes giving their generator polynomials.

We also determine the related polynomial representation of its duals in terms of the generator polynomials.

This work has been partially supported by the Spanish MICINN grant TIN2013-40524-P and by the Catalan grant 2014SGR691.

1

Références

Documents relatifs

As mentioned in Section 3, good candidates for non-zero-locator codes are cyclic codes with small minimum distance and lowest code-rate k ` /n `. We consider binary cyclic codes

Future work is the decoding up to our bound and the classification of cyclic codes, where the non-zero-locator code gives a good bound on the minimum distance.

In [10], quasi-cyclic codes are regarded as concatenation of cyclic codes, while in [13], the authors regard them as linear codes over an auxiliary ring.. In [5], the approach is

To solve the generalized eigenvalue problem (21) and, hence, to find energy values and functions of the two–center Dirac Hamiltonian, we first need to compute the matrix

In practice we do online decoding with a subset of the system BIN (we take the minimal number of equations t o have a single solution, and choose the equations of minimal

In the present paper, we prove that the system of the Newton’s identities can be used for offline Gr¨obner bases computation, (called One Step Decoding in de Boer and

In this section, we will give some properties of these Green functions that we will need later. The proof of the following lemma is based on elementary potential theory on the

What is the minimum positive integer n such that every set of n points in general position in R d has the property that the convex hulls of all k-sets do not have a transversal (d