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.