For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Large Class of p-Ary Cyclic Codes and Sequence Families
Zhengchun ZHOU Xiaohu TANG Udaya PARAMPALLI
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2010/11/01
Online ISSN: 1745-1337
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Signal Design and its Application in Communications)
cyclic code, p-ary sequence, quadratic form,
Full Text: PDF(297.9KB)>>
Let n,k,e,m be positive integers such that n≥ 3, 1 ≤ k ≤ n-1, gcd(n,k)=e, and m= is odd. In this paper, for an odd prime p, we derive a lower bound for the minimal distance of a large class of p-ary cyclic codes Cl with nonzeros α-1, α-(pk+1), α-(p3k+1), …, α-(p(2l-1)k+1), where 1 ≤ l ≤ and α is a primitive element of the finite field Fpn. Employing these codes, p-ary sequence families with a flexible tradeoff between low correlation and large size are constructed.