Presentation 2010-03-05
On Constant Weight Codes with Large Linear Complexity from Cyclic Difference Set
Takayasu KAIDA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We propose a method for q-ary codes from the cyclic difference set by generalization of the method in binary case by N. Li, et al in 2008. This code is the constant weight code in case that q is a prime or prime power. We give two examples of q-ary codes including one non-constant weight code and one constant weight code. For an example of constant weight code, we calculate the value distribution of elements, the auto-correlation and the cross-correlation of the Hamming weight, and the linear compelxity and its profiles.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) constant weight code / cyclic difference set / Hamming distance / linear complexity / periodic sequence
Paper # IT2009-135,ISEC2009-143,WBS2009-114
Date of Issue

Conference Information
Committee ISEC
Conference Date 2010/2/25(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On Constant Weight Codes with Large Linear Complexity from Cyclic Difference Set
Sub Title (in English)
Keyword(1) constant weight code
Keyword(2) cyclic difference set
Keyword(3) Hamming distance
Keyword(4) linear complexity
Keyword(5) periodic sequence
1st Author's Name Takayasu KAIDA
1st Author's Affiliation Department of Information and Computer Sciences, Faculty of Human-Oriented Science and Engineering, Kinki University()
Date 2010-03-05
Paper # IT2009-135,ISEC2009-143,WBS2009-114
Volume (vol) vol.109
Number (no) 445
Page pp.pp.-
#Pages 4
Date of Issue