22 research outputs found

    Some Constacyclic Codes over Finite Chain Rings

    Full text link
    For λ\lambda an nn-th power of a unit in a finite chain ring we prove that λ\lambda-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some constacylic codes. We also study the α+pβ\alpha +p \beta-constacyclic codes of length psp^s over the Galois ring GR(pe,r)GR(p^e,r)

    A NOTE ON NEGACYCLIC AND CYCLIC CODES OF LENGTH p(s) OVER A FINITE FIELD OF CHARACTERISTIC p

    Get PDF
    Recently, the minimum Hamming weights of negacyclic and cyclic codes of length p(s) over a finite field of characteristic p are determined in [4]. We show that the minimum Hamming weights of such codes can also be obtained immediately using the results of [1]
    corecore