Two_Generalizations_for_Quadratic_Residue_Codes_over_Finite_Fields

From MaRDI portal
Two Generalizations for Quadratic Residue Codes over Finite Fields




Abstract: It's well known that the quadratic residue code over finite fields is an interesting class of cyclic codes for its higher minimum distance. Let g be a positive integer and p,p1,ldots,pg be distinct odd primes, the present paper generalizes the constructions for the quadratic residue code with length p to be the length n=p1cdotspg, and to be the case m-th residue codes with length p over finite fields, where mgeq2 is a positive integer. Furthermore, a criterion for that these codes are self-orthogonal or complementary dual is obtained, and then the corresponding counting formula are given. In particular, the minimum distance of all 24 quaternary quadratic residue codes [15,8] are determined.














This page was built for publication: Two_Generalizations_for_Quadratic_Residue_Codes_over_Finite_Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6332433)