Cyclic Codes Over Gf(4) and Gf(2) (Q3325628)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3856989
Language Label Description Also known as
default for all languages
No label defined
    English
    Cyclic Codes Over Gf(4) and Gf(2)
    scientific article; zbMATH DE number 3856989

      Statements

      Cyclic Codes Over Gf(4) and Gf(2) (English)
      0 references
      0 references
      1983
      0 references
      generator polynomial of a cyclic code
      0 references
      p-codes
      0 references
      unreal codes
      0 references
      idempotents
      0 references
      quadripotents
      0 references
      BCH bound
      0 references
      binary codes
      0 references
      If C is a linear code over \(GF(p^ 2)\), p a prime number, then it is possible to define several other codes from C, for instance the subcode \(C_ 0\) consisting of the codewords of C with all the components in GF(p). Using the fact that \(GF(p^ 2)\) is a quadratic extension of GF(p), the author carries out a thorough study of these codes: in particular he characterizes p-codes (codes over \(GF(p^ 2)\) having a generator matrix with entries in GF(p)) and unreal codes (codes over \(GF(p^ 2)\) for which \(C_ 0=\{0\})\). He then analyzes cyclic codes and in the case \(p=2\) gives results about idempotents and quadripotents which allow him to construct cyclic codes over GF(4) which are not 2-codes and whose real parts coincide with a given binary cyclic code C'; also, an improvement of the BCH bound for a class of binary codes is given. Most of the results come from the ''Thèse de 3ème cycle'' (Université de Provence, 1980) of the author and many of them are given without proof. For the entire collection see [Zbl 0513.00004].
      0 references

      Identifiers