Polyadic Constacyclic Codes

From MaRDI portal
Publication:2977286

DOI10.1109/TIT.2015.2451656zbMATH Open1359.94762arXiv1407.1905MaRDI QIDQ2977286FDOQ2977286

Hai Quang Dinh, Bocong Chen, Yun Fan, San Ling

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1407.1905




Recommendations




Cited In (18)





This page was built for publication: Polyadic Constacyclic Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977286)