Polyadic Constacyclic Codes

Bocong Chen; Hai Q. Dinh; Yun Fan; San Ling

Polyadic Constacyclic Codes

Information Theory 2014-07-09 v1 math.IT Number Theory

Authors: Bocong Chen , Hai Q. Dinh , Yun Fan , San Ling

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.

Keywords

coding theory maximum distance separable code

Cite

@article{arxiv.1407.1905,
  title  = {Polyadic Constacyclic Codes},
  author = {Bocong Chen and Hai Q. Dinh and Yun Fan and San Ling},
  journal= {arXiv preprint arXiv:1407.1905},
  year   = {2014}
}

Comments

We provide complete solutions on two basic questions on polyadic constacyclic cdes, and construct some optimal codes from the polyadic constacyclic cdes

Polyadic Constacyclic Codes

Abstract

Keywords

Cite

Comments

Related papers