The permutation group of affine-invariant extended cyclic codes

نویسندگان

  • Thierry P. Berger
  • Pascale Charpin
چکیده

The extended cyclic codes of length p” , p a prime, which are invariant under the aff ine-group acting on ffpm, are called affine-invariant codes. Following recent results of Berger, we present the formal expression of the permutat ion group of these codes. Afterwards we give several tools in order to determine effectively the group of a given code or of some infinite class of codes. W e next prove, by studying some examples, that our tools are efficient. In the end, we give our main application, the permutat ion group of primitive BCH codes def ined on any prime field.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Defining sets of extended cyclic codes invariant under the affine group

We describe the defining sets of extended cyclic codes of length pn over a field and over the ring of integers modulo pe admitting the affine group AGLm(p ), n=mt , as a permutation group. © 2004 Elsevier B.V. All rights reserved. MSC: 94B05; 20B25; 94B15; 94B60

متن کامل

There Are Not Non-obvious Cyclic Affine-invariant Codes

We show that an affine-invariant code C of length p is not permutation equivalent to a cyclic code except in the obvious cases: m = 1 or C is either {0}, the repetition code or its dual. Affine-invariant codes were firstly introduced by Kasami, Lin and Peterson [KLP2] as a generalization of Reed-Muller codes. This class of codes has received the attention of several authors because of its good ...

متن کامل

On the symmetry of good nonlinear codes

It is shown that there are arbitrarily long “good” (in the sense of Gilbert) binary block codes that are preserved under very large permutation groups. This result contrasts sharply with the properties of linear codes: it is conjectured that long cyclic codes are bad, and known that long al&e-invariant codes are bad. 1 T IS the object of this paper to show that there exist arbitrarily long bina...

متن کامل

The Automorphism Groups of BCH Codes and of Some Affine-Invariant Codes Over Extension Fields

Affine-invariant codes are extended cyclic codes of length pm invariant under the affine-group acting on Fpm . This class of codes includes codes of great interest such as extended narrow-sense BCH codes. In recent papers, we classified the automorphism groups of affine-invariant codes [2], [5]. We derive here new results, especially when the alphabet field is an extension field, by expanding o...

متن کامل

On the Security of Some Compact Keys for McEliece Scheme

In this paper we study the security of the key of compact McEliece schemes based on alternant/Goppa codes with a non-trivial permutation group, in particular quasicyclic alternant codes. We show that it is possible to reduce the key-recovery problem on the original quasi-cyclic code to the same problem on a smaller code derived from the public key. This result is obtained thanks to the invarian...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 42  شماره 

صفحات  -

تاریخ انتشار 1996