Polyadic Constacyclic Codes

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, s...

Full description

Saved in:
Bibliographic Details
Main Authors: Chen, Bocong, Dinh, Hai Quang, Fan, Yun, Ling, San
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2015
Subjects:
Online Access:https://hdl.handle.net/10356/103520
http://hdl.handle.net/10220/38325
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-103520
record_format dspace
spelling sg-ntu-dr.10356-1035202023-02-28T19:44:20Z Polyadic Constacyclic Codes Chen, Bocong Dinh, Hai Quang Fan, Yun Ling, San School of Physical and Mathematical Sciences DRNTU::Science::Mathematics::Applied mathematics::Information theory Polyadic constacyclic code p-adic valuation 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. Accepted version 2015-07-14T07:24:57Z 2019-12-06T21:14:27Z 2015-07-14T07:24:57Z 2019-12-06T21:14:27Z 2015 2015 Journal Article Chen, B., Dinh, H. Q., Fan, Y., & Ling, S. (2015). Polyadic constacyclic codes. IEEE transactions on information theory, 61(9), 4895 - 4904. 0018-9448 https://hdl.handle.net/10356/103520 http://hdl.handle.net/10220/38325 10.1109/TIT.2015.2451656 186784 en IEEE transactions on information theory © 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/TIT.2015.2451656]. 23 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Science::Mathematics::Applied mathematics::Information theory
Polyadic constacyclic code
p-adic valuation
spellingShingle DRNTU::Science::Mathematics::Applied mathematics::Information theory
Polyadic constacyclic code
p-adic valuation
Chen, Bocong
Dinh, Hai Quang
Fan, Yun
Ling, San
Polyadic Constacyclic Codes
description 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.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Chen, Bocong
Dinh, Hai Quang
Fan, Yun
Ling, San
format Article
author Chen, Bocong
Dinh, Hai Quang
Fan, Yun
Ling, San
author_sort Chen, Bocong
title Polyadic Constacyclic Codes
title_short Polyadic Constacyclic Codes
title_full Polyadic Constacyclic Codes
title_fullStr Polyadic Constacyclic Codes
title_full_unstemmed Polyadic Constacyclic Codes
title_sort polyadic constacyclic codes
publishDate 2015
url https://hdl.handle.net/10356/103520
http://hdl.handle.net/10220/38325
_version_ 1759855921423450112