2014/07/07 by Bocong Chen, Hai Q. Dinh, Chen, Bocong +5
Computer Science · Engineering · Mathematics · #Cellular Automata and Applications #Code (set theory) #Coding theory and cryptography #Combinatorics #Computer science #Discrete mathematics #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Integer (computer science) #Mathematics #Multiplier (economics) #Number Theory (math.NT) #Type (biology) #cs.IT #graph theory and CDMA systems #math.IT #math.NT
paper · pdf · doi:10.48550/arxiv.1407.1905
We provide complete solutions on two basic questions on polyadic constacyclic cdes, and construct some optimal codes from the polyadic constacyclic cdes
arxiv created 2014/07/07 · openalex publication_date 2014/07/07 · arxiv updated 2014/07/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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.