ISSN 0253-2778

CN 34-1054/N

open

(1+u)-constacyclic codes over the ring F2+uF2+u2F2

  • In view of the factorization of (xn-1) in F2[x], the minimal generating set and rank of (1+u)-constacyclic codes with an arbitrary length over the ring R=F2+uF2+u2F2 were studied. A new Gray map from R to F42 was defined, the structures and generator polynomials of the Gray image of a linear (1+u)-constacyclic code with an arbitrary length were determined, and some optimal binary linear cyclic codes were obtained.
  • loading

Catalog

    {{if article.pdfAccess}}
    {{if article.articleBusiness.pdfLink && article.articleBusiness.pdfLink != ''}} {{else}} {{/if}}PDF
    {{/if}}
    XML

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return