On generalized constant-weight codes over GF(q) from a cyclic difference set and their properties

We recall some constructing methods for constantweight and non-binary codes from cyclic difference sets, and properties of their linear complexities, Hamming and Lee distances. Constant-weight and balanced properties by the authors were introduced and discussed again. In this paper we propose more generalized method of constructing constant-weight codes from the authors' conventional method. Moreover an example of this generalized constant-weight codes over GF(3), and their properties in view of constant-weight and balanced properties are given.

[1]  Junru Zheng,et al.  On q-ary constant weight sequences from cyclic difference sets , 2011, Proceedings of the Fifth International Workshop on Signal Design and Its Applications in Communications.

[2]  Yeow Meng Chee,et al.  Constructions for $q$-Ary Constant-Weight Codes , 2007, IEEE Transactions on Information Theory.

[3]  Lei Hu,et al.  Binary Constant Weight Codes Based on Cyclic Difference Sets , 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[4]  Junru Zheng,et al.  On Constant-Weight Multi-Valued Sequences from Cyclic Difference Sets , 2013, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[5]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[6]  Junru Zheng,et al.  Hamming distance correlation for q-ary constant weight codes , 2010, 2010 International Symposium On Information Theory & Its Applications.

[7]  Junru Zheng,et al.  On correlation properties of 4-phase with zero points from constant-weight sequences over GF(5) , 2013, The Sixth International Workshop on Signal Design and Its Applications in Communications.

[8]  C. Y. Lee,et al.  Some properties of nonbinary error-correcting codes , 1958, IRE Trans. Inf. Theory.

[9]  Guang Gong,et al.  Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar , 2005 .

[10]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[11]  Wataru Yoshida,et al.  A simple derivation of the Berlekamp- Massey algorithm and some applications , 1987, IEEE Trans. Inf. Theory.

[12]  L. D. Baumert.  Cyclic Difference Sets , 1971 .

[14]  T. Kaida,et al.  A set of sequences over Z5 with period 21 including almost highest linear complexities , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[15]  Fanxin Zeng.  Properties of m-Sequence and Construction of Constant Weight Codes , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..