By Topic

Hamming distance correlation for q-ary constant weight codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Takayasu Kaida ; Department of Information and Computer Sciences, Faculty of Humanity-Oriented Science and Engineering, Kinki University, Kayanomori, Iizuka, Fukuoka, 820-8555 Japan ; Junru Zheng

We proposed a method for q-ary constant weight codes from the cyclic difference set by generalization of the method in binary case proposed by N. Li, X. Zeng and L. Hu in 2008. It was shown that two sets of constant weight codes over Z5 with length 21 from the (21, 5, l)-planar (cyclic) difference set and constant weight codes over G F (8) with length 57 from the (57, 8, l)-planar (cyclic) difference set have almost highest linear complexities and good profiles of their linear complexities. Moreover we investigated the value distributions in all codewords with length 57 over G F (8) from the (57, 8, l)-planar difference set. It was pointed out that this set of periodic sequences also has good value distributions and almost highest linear complexities in similar to previous set of sequences over Z5 with period 21. In this paper we calculate the Hamming distance between all distinct cyclic shift of themselves, called the auto-Hamming correlation and the Hamming distance between distinct codewords with all cyclic shift, called the cross-Hamming correlation. Consequently it is shown that all of the auto and cross-Hamming correlations are large against their code length for all codewords over G F (8) with length 57 from a (57, 8, l)-planar difference set.

Published in:

Information Theory and its Applications (ISITA), 2010 International Symposium on

Date of Conference:

17-20 Oct. 2010