Polyadic Constacyclic Codes
Abstract
For any given positive integer m, a necessary and sufficient condition for the existence of Type I m-adic constacyclic codes is given. Further, for any given integer s, a necessary and sufficient condition for s to be a multiplier of a Type I polyadic constacyclic code is given. As an application, some optimal codes from Type I polyadic constacyclic codes, including generalized Reed-Solomon codes and alternant MDS codes, are constructed.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.