On Constant-Weight Multi-Valued Sequences from Cyclic Difference Sets
スポンサーリンク
概要
- 論文の詳細を見る
We proposed a method for constructing constant-weight and multi-valued sequences from the cyclic difference sets by generalization of the method in binary case proposed by N. Li, X. Zeng and L. Hu in 2008. In this paper we give some properties about sets of such sequences and it is shown that a set of non-constant-weight sequences over Z4 with length 13 from the (13,4,1)-cyclic difference set, and a set of constant-weight sequences over Z5 with length 21 from the (21,5,1)-cyclic difference set have almost highest linear complexities and good profiles of all sequences' linear complexities. Moreover we investigate the value distribution, the linear complexity and correlation properties of a set of sequences with length 57 over GF(8) from the (57,8,1)-cyclic difference set. It is pointed out that this set also has good value distributions and almost highest linear complexities in similar to previous two sets over Z4 with length 13 and Z5 with length 21.
著者
-
Kaida Takayasu
Department Of Information And Computer Sciences Faculty Of Humanity-oriented Science And Engineering
-
Zheng Junru
Department Of Human Development Faculty Of Human Sciences Kyushu Women's University
-
KAIDA Takayasu
Department of Information and Computer Sciences, Faculty of Humanity-Oriented Science and Engineering, Kinki University
-
ZHENG Junru
Department of Human Development, Faculty of Humanities, Kyushu Women's University
関連論文
- A Note on the Shift Bound for Cyclic Codes by the DFT
- Value Distribution of Linear Complexity for p-Ary Periodic Sequences with Period p^n, p a Prime
- Some Properties of the Schaub Bound and Its Improvement for Cyclic Codes
- On Linear Complexity and Schaub Bound for Cyclic Codes by Defining Sequence with Unknown Elements(Sequence Design and its Application in Communications)
- A Note on Decoding Algorithm by Calculation of Schaub Bound for Cyclic Codes
- On Relationship between the Boston Bound and Well-Known Bounds for Cyclic Codes
- An Improvement of the Hartmann-Tzeng Bound for Cyclic Codes and Their Binary and Short Examples
- Construction of Independent Set and Its Application for Designed Minimum Distance
- On Constant-Weight Multi-Valued Sequences from Cyclic Difference Sets