| Author(s) | |
|---|---|
| Abstract |
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.
|
| Format | |
| Identifier(s) | |
| Publication Date |
2015-09-01
|
| Publication Title |
IEEE
|
| Volume |
61
|
| Issue |
9
|
| First Page |
4895
|
| Last Page |
4904
|
| Keywords | |
| Community | |
| Recommended Citation |
Chen, Bocong; Dinh, Hai Q; Fen, Yun; Ling, San (2015). Polyadic Constacyclic Codes. IEEE 61(9) 4895-4904. doi: 10.1109/TIT.2015.2451656. Retrieved from https://oaks.kent.edu/mathpubs/4
|