Takayasu Kaida

According to our database1, Takayasu Kaida authored at least 26 papers between 1996 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
On the consecutive sets of defining sequence for lower bounds on cyclic codes.
Proceedings of the Eighth International Workshop on Signal Design and Its Applications in Communications, 2017

2015
On the Rank Bounded Distance with Conjugate Elements for Cyclic Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

The computational complexity of some algorithms for the rank bounded distance on cyclic codes.
Proceedings of the Seventh International Workshop on Signal Design and its Applications in Communications, 2015

On linear complexity of periodic sequences over extension fields from cyclic difference sets.
Proceedings of the Seventh International Workshop on Signal Design and its Applications in Communications, 2015

2014
On generalized constant-weight codes over GF(q) from a cyclic difference set and their properties.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

2013
On Constant-Weight Multi-Valued Sequences from Cyclic Difference Sets.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

On relationship between proposed lower bound and well-known bounds for cyclic codes.
Proceedings of the Sixth International Workshop on Signal Design and Its Applications in Communications, 2013

On correlation properties of 4-phase with zero points from constant-weight sequences over GF(5).
Proceedings of the Sixth International Workshop on Signal Design and Its Applications in Communications, 2013

On some algorithms on the proposed lower bound of the designed minimum distance for cyclic codes.
Proceedings of the 19th Asia-Pacific Conference on Communications, 2013

2012
Construction of Independent Set and Its Application for Designed Minimum Distance.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

The designed minimum distance of medium lengths for binary cyclic codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

On improved algorithms of the proposed lower bound including well-known bounds for cyclic codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

2011
On relationship between proposed lower bound and shift bound for cyclic codes.
Proceedings of the Fifth International Workshop on Signal Design and its Applications in Communications, 2011

On q-ary constant weight sequences from cyclic difference sets.
Proceedings of the Fifth International Workshop on Signal Design and its Applications in Communications, 2011

2010
A Note on the Shift Bound for Cyclic Codes by the DFT.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

An algorithm for new lower bound of minimum distance by DFT for cyclic codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

Hamming distance correlation for q-ary constant weight codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

2009
On Relationship between the Boston Bound and Well-Known Bounds for Cyclic Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

2006
On Linear Complexity and Schaub Bound for Cyclic Codes by Defining Sequence with Unknown Elements.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

2005
A Typical Profile of the k-Error Linear Complexity for Balanced Binary Sequences with Period 2n.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

2004
On the Generalized Lauder-Paterson Algorithm and Profiles of the k-Error Linear Complexity for Exponent Periodic Sequences.
Proceedings of the Sequences and Their Applications, 2004

2003
Linear Complexities of Periodic Sequences Obtained from Sequences over <i>Z</i><sub>4</sub> and <i>Z</i><sub>8</sub> by One-Symbol Substitution.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

2001
On the Profile of the k-Error Linear Complexity and the Zero Sum Property for Sequences over GF(p m) with Period p n.
Proceedings of the Sequences and their Applications, 2001

1999
An Algorithm for thek-Error Linear Complexity of Sequences over GF(p<sup>m</sup>) with Period p<sup>n</sup>, pa Prime.
Inf. Comput., 1999

1998
A New Algorithm for the k -Error Linear Complexity of Sequences over GF(p m) with Period p n.
Proceedings of the Sequences and their Applications, 1998

1996
Computation of the k-Error Linear Complexity of Binary Sequences with Period 2<sup>n</sup>.
Proceedings of the Concurrency and Parallelism, 1996


  Loading...