Repository landing page
Repeated-root cyclic and negacyclic codes over a finite chain ring
Abstract
We show that repeated-root cyclic codes over a finite chain ring are in general not principally generated. Repeated-root negacyclic codes are principally generated if the ring is a Galois ring with characteristic a power of 2. For any other finite chain ring they are in general not principally generated. We also prove results on the structure, cardinality and Hamming distance of repeated-root cyclic and negacyclic codes over a finite chain ringSimilar works
Full text
Last time updated on 26/03/2020
This paper was published in Loughborough University Institutional Repository.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.