Abstract
A finite group is said to be metacyclic if it has a cyclic normal subgroup N such that G∕N is cyclic. A code over a finite field F is called metacyclic if it is a left ideal in the group algebra FG, with G a metacyclic group. Metacyclic codes are generalizations of dihedral codes, and can be constructed as quasi-cyclic codes with an extra automorphism.In this paper, we prove that metacyclic codes form an asymptotically good family of codes. Our proof relies on Artin’s primitive root conjecture for primes in certain arithmetic progressions being true, something that currently can only be guaranteed assuming the Generalized Riemann Hypothesis (GRH).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
