1. Open Access Kent State
  2. Polyadic Constacyclic Codes
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
Article
Identifier(s)
10.1109/TIT.2015.2451656
Publication Date
2015-09-01
Publication Title
IEEE
Volume
61
Issue
9
First Page
4895
Last Page
4904
Keywords
Rights
http://rightsstatements.org/vocab/InC/1.0/
Community
Department of Mathematical Sciences
Permalink https://oaks.kent.edu/mathpubs/4
Chen, B., Dinh, H., Fen, Y., & Ling, S. (2015). Polyadic Constacyclic Codes (1–). IEEE. https://doi.org/10.1109/TIT.2015.2451656
Chen, Bocong, Hai Dinh, Yun Fen, and San Ling. 2015. “Polyadic Constacyclic Codes”. IEEE. https://doi.org/10.1109/TIT.2015.2451656.
Chen, Bocong, et al. Polyadic Constacyclic Codes. IEEE, 1 Sept. 2015, https://doi.org/10.1109/TIT.2015.2451656.