Trinômes irréductibles sur F2 et codes cycliques ternaires de rendements 1/2

Abstract : Considering polynomials over the Galois finite fields for two elements, our intention stand over the divisibility of the trinomials x^am+x^bs+1, for m>s ≥ 1, by an irreducible polynomial of degree r, for this, we contribute to the result :If there exist positive integers m, s such that the trinomial x^am+x^bs+1 is divisible by an irreducible polynomial of degree r over F2, then a and b are not divisible by (2^r- 1). For this type of trinomials we conjectured that the ratios πM(a,b)/ πM(1,1) tend to a finite limit (dependently of a and b) when M tend to infinity. Our research stand at sequel on the cyclic codes of rate 1/2 over the two finite fields F3 and F5 and we check our research over whose are isodual. The so-called fundamental problem in coding theory is finding the largest value of dq for which a code of parameters [n, q, d] over Fq exists. In this context we have successfully optimize this distance for the cyclic codes of rate 1/2 over F3 and F5 up to length 74 for the ternary cyclic codes and 42 for whose over F5. We have also successful to construct seven classes of isodual cyclic codes over the field of 3 elements and three classes over the field of 5 elements.
Document type :
Theses
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://pastel.archives-ouvertes.fr/tel-01145440
Contributor : Abes Star <>
Submitted on : Friday, April 24, 2015 - 11:37:06 AM
Last modification on : Wednesday, February 20, 2019 - 2:40:06 PM
Long-term archiving on : Monday, September 14, 2015 - 1:11:02 PM

File

TheseMihoubi.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01145440, version 1

Citation

Cherif Mihoubi. Trinômes irréductibles sur F2 et codes cycliques ternaires de rendements 1/2. Mathématiques générales [math.GM]. Télécom ParisTech, 2012. Français. ⟨NNT : 2012ENST0084⟩. ⟨tel-01145440⟩

Share

Metrics

Record views

305

Files downloads

427