Title

Polyadic Constacyclic Codes

Publication Title

IEEE Transactions on Information Theory

Publication Date

9-2015

Document Type

Article

DOI

10.1109/TIT.2015.2451656

Keywords

Berlekamp-Welch decoding algorithm, polyadic constacyclic code, alternant code

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.

Publisher

IEEE


Share

COinS