DocumentCode
873272
Title
Polyadic codes revisited
Author
Ling, San ; Xing, Chaoping
Author_Institution
Dept. of Math., Nat. Univ. of Singapore, Singapore
Volume
50
Issue
1
fYear
2004
Firstpage
200
Lastpage
207
Abstract
We generalize the notions of duadic codes, triadic codes, polyadic codes, and split group codes to include noncyclic Abelian codes. Necessary and sufficient conditions for the existence of such codes, and properties such as a duality property and a lower bound on the minimum weight of the subcode of "odd-like" codewords, are studied. This construction and its modification lead to many good codes, eight of which have minimum distance better than the lower bound given in Brouwer\´s table.
Keywords
binary codes; cyclic codes; dual codes; group codes; cyclic codes; duadic codes; duality property; lower bound; minimum distance; minimum weight; noncyclic Abelian codes; odd-like codewords; polyadic codes; split group codes; subcode; triadic codes; Chaos; Codes; Galois fields; Mathematics; Polynomials; Sufficient conditions;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2003.821986
Filename
1262629
Link To Document