Polyadic Constacyclic Codes
Bocong Chen, Hai Quang Dinh, Yun Fan, San Ling · IEEE Transactions on Information Theory · 2015
For any given positive integer m, a necessary and sufficient condition for the existence of Type-I m-adic constacyclic codes is given. Furthermore, 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 maximum distance separable codes, are constructed.