A Large Class of p-Ary Cyclic Codes and Sequence Families

スポンサーリンク

概要

• 論文の詳細を見る

• Let n, k, e, m be positive integers such that n ≥ 3, 1 ≤ k ≤ n - 1, gcd(n, k) = e, and $m={n\\over e}$ 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\\leq l\\leq {m-1\\over 2}$ 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.

• 2010-11-01

著者

• Tang Xiaohu

  Provincial Key Lab Of Information Coding And Transmission Institute Of Mobile Communications Southwe

• PARAMPALLI Udaya

  Department of Computer Science and Software Engineering, University of Melbourne

• ZHOU Zhengchun

  School of Mathematics, Southwest Jiaotong University

• Zhou Zhengchun

  School Of Mathematics Southwest Jiaotong University

• Parampalli Udaya

  Department Of Computer Science And Software Engineering University Of Melbourne

関連論文

• New Families of Binary Sequences with Low Correlation and Large Size
• New p-Ary Sequences with Low Correlation and Large Family Size
• A New Set of Optimal Frequency-Hopping Sequences
• A Large Class of p-Ary Cyclic Codes and Sequence Families
• New Families of Optimal Zero Correlation Zone Sequences Based on Interleaved Technique and Perfect Sequences
• Low Correlation Zone Sequences from Interleaved Construction
• New Families of Binary Low Correlation Zone Sequences Based on Interleaved Quadratic Form Sequences
• Orthogonal and ZCZ Sets of Real-Valued Periodic Orthogonal Sequences from Huffman Sequences

スポンサーリンク