Takayasu KAIDA


On the Rank Bounded Distance with Conjugate Elements for Cyclic Codes
Junru ZHENG Takayasu KAIDA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2015/12/01
Vol. E98-A  No. 12  pp. 2476-2479
Type of Manuscript:  Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
defining setdiscrete Fourier transformrank bounded distanceminimum distancecyclic code
 Summary | Full Text:PDF(99.8KB)

On Constant-Weight Multi-Valued Sequences from Cyclic Difference Sets
Takayasu KAIDA Junru ZHENG 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2013/01/01
Vol. E96-A  No. 1  pp. 171-176
Type of Manuscript:  Special Section PAPER (Special Section on Cryptography and Information Security)
Category: Foundations
Keyword: 
constant-weight sequencemulti-valued sequencecyclic difference setvalue distributionlinear complexitycorrelation property
 Summary | Full Text:PDF(515.6KB)

Construction of Independent Set and Its Application for Designed Minimum Distance
Junru ZHENG Takayasu KAIDA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2012/12/01
Vol. E95-A  No. 12  pp. 2107-2112
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
discrete Fourier transformindependent setshift boundminimum distancecyclic code
 Summary | Full Text:PDF(517.3KB)

A Note on the Shift Bound for Cyclic Codes by the DFT
Junru ZHENG Takayasu KAIDA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2010/11/01
Vol. E93-A  No. 11  pp. 1918-1922
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
Blahut theoremlower bounddiscrete Fourier transformcyclic codeminimum distance
 Summary | Full Text:PDF(251.5KB)

On Relationship between the Boston Bound and Well-Known Bounds for Cyclic Codes
Junru ZHENG Takayasu KAIDA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2009/10/01
Vol. E92-A  No. 10  pp. 2484-2486
Type of Manuscript:  Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
Boston boundcyclic codedefining setBCH boundHartmann-Tzeng boundminimum distance
 Summary | Full Text:PDF(72.3KB)

On Linear Complexity and Schaub Bound for Cyclic Codes by Defining Sequence with Unknown Elements
Junru ZHENG Takayasu KAIDA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/09/01
Vol. E89-A  No. 9  pp. 2337-2340
Type of Manuscript:  Special Section LETTER (Special Section on Sequence Design and its Application in Communications)
Category: 
Keyword: 
cyclic codedefining sequenceminimum distancelower boundSchaub algorithmunknown element
 Summary | Full Text:PDF(95.5KB)

A Typical Profile of the k-Error Linear Complexity for Balanced Binary Sequences with Period 2n
Takayasu KAIDA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/01/01
Vol. E88-A  No. 1  pp. 311-313
Type of Manuscript:  Special Section LETTER (Special Section on Cryptography and Information Security)
Category: 
Keyword: 
pseudo-random sequenceprofile of k-error linear complexitybalanced binary exponent periodic sequenceGames-Chan algorithmStamp-Martin algorithmLauder-Paterson algorithm
 Summary | Full Text:PDF(82.9KB)

Linear Complexities of Periodic Sequences Obtained from Sequences over Z4 and Z8 by One-Symbol Substitution
Tsutomu MORIUCHI Satoshi UEHARA Takayasu KAIDA Kyoki IMAMURA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2003/05/01
Vol. E86-A  No. 5  pp. 1285-1293
Type of Manuscript:  PAPER
Category: Information Theory
Keyword: 
sequences over Z4 and Z8linear complexityone-symbol substitutionbasic irreducible (primitive) polynomial
 Summary | Full Text:PDF(305.7KB)

Value Distribution of Linear Complexity for p-Ary Periodic Sequences with Period pn, p a Prime
Satoshi UEHARA Kyoki IMAMURA Takayasu KAIDA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/05/25
Vol. E80-A  No. 5  pp. 920-921
Type of Manuscript:  LETTER
Category: Information Theory and Coding Theory
Keyword: 
p-ary periodic sequenceperiod pnlinear complexitydistribution of linear complexity
 Summary | Full Text:PDF(111.7KB)