Consta-Abelian polyadic codes

Author

Lim, Chong Jie

Author_Institution

Dept. of Math., Nat. Univ. of Singapore

Volume

51

Issue

6

fYear

2005

fDate

6/1/2005 12:00:00 AM

Firstpage

2198

Lastpage

2206

Abstract

In this correspondence, the class of polyadic codes is generalized to the class of consta-Abelian polyadic codes, which, in particular, includes the class of constacyclic polyadic codes. Properties such as the equivalence of polyadic codes and the mth-root lower bound for the minimum weight of a subcode of certain types of polyadic codes are preserved in the consta-Abelian case. Sufficient conditions for the existence of this class of codes are established. For the special case of constacyclic codes, the characterization of negacyclic self-dual codes of length coprime to the characteristic of the field in terms of negacyclic duadic codes is also given

Keywords

cyclic codes; discrete Fourier transforms; dual codes; group codes; consta-Abelian polyadic code; constacyclic code; coprime length; duadic code; minimum weight; negacyclic self-dual code; twisted discrete Fourier transform; Algebra; Discrete Fourier transforms; Galois fields; Linear code; Mathematics; Packaging; Sufficient conditions; Consta-Abelian codes; constacyclic codes; minimum weight; polyadic codes; self-dual codes; twisted discrete Fourier transform;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2005.847734

Filename

1435662