KINDAI UNIVERSITY


*A space between the first name and last name, please enter

Takayasu Kaida

Profile

FacultyDepartment of Information and Computer Science / Graduate School of Industory / Faculty of Engineering, Information Education Center
PositionSpecially Appointed Associate Professor
Degree
Commentator Guidehttps://www.kindai.ac.jp/meikan/298-kaida-takayasu.html
URL
Mail
Last Updated :2019/10/19

Education and Career

Education

  •  - 1996 , Kyushu Institute of Technology, Graduate School, Division of Information Engineering
  •  - 1994 , Kyushu Institute of Technology, Graduate School, Division of Information Engineering
  •  - 1992 , Kyushu Institute of Technology, Faculty of Computer Science and Systems Engineering, Departmento of Computer Science and Electoronics

Academic & Professional Experience

  •   1996 ,  - 2003 , Yatsushiro National College of Technology,
  • Research Associate

Research Activities

Research Areas

  • Electrical and electronic engineering, Communication/Network engineering
  • Electrical and electronic engineering, Communication/Network engineering

Research Interests

  • Algebraic Geometric Code, Pseudo-Random Sequence

Published Papers

  • On the Rank Bounded Distance with Conjugate Elements for Cyclic Codes., Junru Zheng,Takayasu Kaida, IEICE Transactions, 98-A(12), 2476 - 2479, 2015 , Refereed
  • On correlation properties of 4-phase with zero points from constant-weight sequences over GF(5), Proc. of the 6th International Workshop on Signal Design and Its Applications in Communications, 36 - 39, Oct. 2013
  • On relationship between proposed lower bound and well-known bounds for cyclic codes, Proc. of the 6th International Workshop on Signal Design and Its Applications in Communications, 32 - 35, Oct. 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 Comminications, 526 - 530, Aug. 2013
  • On correlation properties of 4-phase with zero points from constant-weight sequences over GF(5)., Takayasu Kaida,Junru Zheng, The Sixth International Workshop on Signal Design and Its Applications in Communications, IWSDA 2013, Tokyo, Japan, October 27 - November 1, 2013, 36 - 39, 2013 , Refereed
  • On constant-weight multi-valued sequences from cyclic difference sets, KAIDA Takayasu, ZHENG Junru, IEICE Transactions on Fundamentals, E96-A(1), Jan. 2013 , Refereed
  • On relationship between proposed lower bound and well-known bounds for cyclic codes., Junru Zheng,Takayasu Kaida, The Sixth International Workshop on Signal Design and Its Applications in Communications, IWSDA 2013, Tokyo, Japan, October 27 - November 1, 2013, 32 - 35, 2013 , Refereed
  • On Constant-Weight Multi-Valued Sequences from Cyclic Difference Sets., Takayasu Kaida,Junru Zheng, IEICE Transactions, 96-A(1), 171 - 176, 2013 , Refereed
  • On improved algorithms of the proposed lower bound including well-known bounds for cyclic codes., Takayasu Kaida,Junru Zheng, Proceedings of the International Symposium on Information Theory and its Applications, ISITA 2012, Honolulu, HI, USA, October 28-31, 2012, 446 - 449, 2012 , Refereed
  • Construction of Independent Set and Its Application for Designed Minimum Distance, ZHENG Junru, KAIDA Takayasu, IEICE Transactions on Fundamentals, E95-A(12), 2107 - 2112, Dec. 2012 , Refereed
  • The designed minimum distance of medium lengths for binary cyclic codes., Junru Zheng,Takayasu Kaida, Proceedings of the International Symposium on Information Theory and its Applications, ISITA 2012, Honolulu, HI, USA, October 28-31, 2012, 441 - 445, 2012 , Refereed
  • Construction of Independent Set and Its Application for Designed Minimum Distance., Junru Zheng,Takayasu Kaida, IEICE Transactions, 95-A(12), 2107 - 2112, 2012 , Refereed
  • The Weber-Fechner Law, TAKAHASHI Keiichi, HIRANO Go, HASEGAWA Tetsuya, KANEMITSU Shigeru, KAIDA Takayasu, TSUKADA Haruo, Siauliai Mathematical Seminar, 6(14), 85 - 91, Nov. 2011 , Refereed
  • 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 Communicati, 13 - 16, Oct. 2011
  • On q-ary constant weight sequences from cyclic difference sets., Takayasu Kaida,Junru Zheng, Fifth International Workshop on Signal Design and its Applications in Communications, IWSDA 2011, Guilin, China, October 10-14, 2011, 126 - 129, 2011 , Refereed
  • On q-Ary Constant Weight Sequences from Cyclic Difference Sets, Proceedings of the Fifth International Workshop on Signal Design and Its Applications in Communicati, 126 - 129, Oct. 2011
  • On relationship between proposed lower bound and shift bound for cyclic codes., Junru Zheng,Takayasu Kaida, Fifth International Workshop on Signal Design and its Applications in Communications, IWSDA 2011, Guilin, China, October 10-14, 2011, 13 - 16, 2011 , Refereed
  • A note on the shift bound for cyclic codes by the DFT, ZHENG Junru, KAIDA Takayasu, IEICE Transactions on Fundamentals, E93-A(11), 1918 - 1922, Nov. 2010 , Refereed
  • An algorithm for New Lower Bound of Minimum Distance by DFT for Cyclic Codes, Proceedings of 2010 International SymposIum on Information and its Applications, 846 - 849, Oct. 2010
  • Hamming Distance Correlation for q-Ary Constant Weight Codes from Cyclic Difference Sets, Proceedings of 2010 International Symposum on Information Theory and its Applications, 842 - 845, Oct. 2010
  • An algorithm for new lower bound of minimum distance by DFT for cyclic codes., Junru Zheng,Takayasu Kaida, Proceedings of the International Symposium on Information Theory and its Applications, ISITA 2010, 17-20 October 2010, Taichung, Taiwan, 846 - 849, 2010 , Refereed
  • A Set of Sequences over Z_5 with Period 21 including Almost Highest Linear Complexities, Proceedings of 2010 IEEE Information Theory Workshop, 226 - 228, Jan. 2010
  • Hamming distance correlation for q-ary constant weight codes., Takayasu Kaida,Junru Zheng, Proceedings of the International Symposium on Information Theory and its Applications, ISITA 2010, 17-20 October 2010, Taichung, Taiwan, 842 - 845, 2010 , Refereed
  • A Note on the Shift Bound for Cyclic Codes by the DFT., Junru Zheng,Takayasu Kaida, IEICE Transactions, 93-A(11), 1918 - 1922, 2010 , Refereed
  • A Note on Constant Weight Sequences over q-Ary from Cyclic Difference Sets, Proceedings of Fourth International Workshop on Signal Design and its Applications on Communications, 112 - 113, Oct. 2009
  • On Boston Bound for Cyclic Codes by DFT with Unknown Elements, Proceedimgs of Fourth International Workshop on Signal Design and its Application in Communications, 108 - 111, Oct. 2009
  • On Relationship between the Boston Bound and Well-Known Bounds for Cyclic Codes., Junru Zheng,Takayasu Kaida, IEICE Transactions, 92-A(10), 2484 - 2486, 2009 , Refereed
  • On relationship between the Boston bound and well-known bound for cyclic codes, ZHENG Junru, KAIDA Takayasu, IEICE Transactions on Fundamentals, E92-A(10), 2484 - 2486, Oct. 2009 , Refereed
  • A Constructing Approach of the Roos Bound for Cyclic Codes, Proceedings of 2008 Internationl Symposium on Information and its Applications, 395 - 399, Dec. 2008
  • A Decoding Method up to the Hartmann-Tzeng Bound using the DFT for Cyclic Codes, Proceedings of 2007 Asia-Pacific Conference on Communications, 409 - 412, Oct. 2007
  • Equivalence between the BCH Bound and the Schaub* Bound for Cyclic Codes, Proceedings of 2006 IEEE Information Theory Workshop, 29 - 32, Oct. 2006
  • On Linear Complexity and Schaub Bound for Cyclic Codes by Defining Sequence with Unknown Elements., Junru Zheng,Takayasu Kaida, IEICE Transactions, 89-A(9), 2337 - 2340, 2006 , Refereed
  • On linear complexity and Schaub bound for cyclic codes by defining sequence with unknown elemetns, ZHENG Junru, KAIDA Takayasu, IEICE Transactions on Fundamentals, E89-A(9), 2337 - 2340, Oct. 2006 , Refereed
  • A Typical Profile of the k-Error Linear Complexity for Balanced Binary Sequences with Period 2n., Takayasu Kaida, IEICE Transactions, 88-A(1), 311 - 313, 2005 , Refereed
  • A typical profile of the k-error linear complexity for nalanced binary sequences with period 2^n, KAIDA Takayasu, IEICE Transactions on Fundamentals, E88-A(1), 311 - 313, Jan. 2005 , Refereed
  • On the Generalized Lauder-Paterson Algorithm and Profiles of the k-Error Linear Complexity for Exponent Periodic Sequences., Takayasu Kaida, Sequences and Their Applications - SETA 2004, Third International Conference, Seoul, Korea, October 24-28, 2004, Revised Selected Papers, 166 - 178, 2004 , Refereed
  • Linear complexities of periodic sequences obtained form sequences over Z_4 and Z_8 by one-symbol substitution, MORIUCHI Tsutomu, UEHARA Satoshi, KAIDA Takayasu, IMAMURA Kyoki, IEICE Transactions on Fundamentals, E86-A(5), 1285 - 1293, May 2003 , Refereed
  • An algorithm for the k-error linear complexity of sequences over GF(p^m) with period p^n, p a prime, KAIDA Takayasu, UAHARA Satoshi, IMAMURA Kyoki, Information and Computation, 151, 134 - 147, May 1999 , Refereed
  • Computation of the k-Error Linear Complexity of Binary Sequences with Period 2n., Takayasu Kaida,Satoshi Uehara,Kyoki Imamura, Concurrency and Parallelism, Programming, Networking, and Security: Second Asian Computing Science Conference, ASIAN '96, Singapore, December 2-5, 1996, Proceedings, 182 - 191, 1996 , Refereed
  • Value distribution of linear complexity for q-ary periodic sequences with period p^n, p a prime, UEHARA Satoshi, KAIDA Takayasu, IMAMURA Kyoki, IEICE Transactions on Fundamentals, E80-A(5), 920 - 921, May 1997 , Refereed

Books etc

  • Sequence Design and Applications for CDMA, The Feng-Rao Designed Minimum Distance for Binary Linear Codes Does Not Have an Odd Number Except One, Joint Work,   2001 09
  • Advanced Signal Processing for Communication Systems, The Feng-Rao Desiged Minimum Distance of Binary Linear Codes and Cyclic Codes, Joint Work, KLuwer Academic Publishers,   2002 11
  • Construction of Algebraic Geometric Codes with High Degree Places by Niederreiter et. al., over Rational Function Fields, Record of 1999 Joint Conference of Electrical and Electronics Engineers in Kyusyu,   1999
  • A Note on Feng-Rao Designed Mimimum Distance of Binary and Cyolic Codes, The Proceedings of the 22nd symposium on Information Theory and Its Applications,   1999
  • On Algebraic Geometric Codes with High Degree Places by Niederreiter et. al., over Some Curves, The Proceedings of the 22nd symposium on Information Theory and Its Applications,   1999
  • On the k-error Linear Complexity of One-symbol-insertion from M-sequences, The Proceedings of the 2000 Symposium on Cryptgraphy and Information Security,   2000
  • Formula for Computing the Linear Complexity of Periodic Sequences, Record of 1993 Joint conference of Electrical and Electronics Engineers in Kyushu,   1993
  • On the Method for Computing the Linear Complexity of Periodic Sequences, The Proceedings of the 16th Symposiuum on Information Theory and its Applications,   1993
  • Value Distribution of Linear Complexity for p-ary Periodic Sequences with Period Pn, pa Prime, Technical Report of IEICE,   1994
  • Periodic Sequences Whose Minimum Changes Have Maximum Linear Complexity, Record of 1994 Joint conference of Electrical and Electronics Engineers in Kyushu,   1994
  • Construction of Periodic Sequences Whose Minimum Changes Have Maximum Linear Complexity, The Proceedings of the 17th Symposium on Information Theory and its Applications,   1994
  • A Note on Algebraic Geometric Codes with High Degree Places, The Proceedings of the 18th Symposium on Information Theory and its Applications,   1995
  • Computation of the k-Error Linear Complexity of Binary Sequences with Period 2n, Technical Report of IEICE ISEC96,   1996
  • An Algorithm for the k-Error Linear Complexity of Sequences over GF(3) with Period 3n(共著), The Proceedings of 1996 International Symposium on Information Theory and Its Applications,   1996
  • Some Families of Sequences over Z4 and Z8, and Their Characteristic Polynomials(共著), The Proceeding of the 1996 International Symposium on Information Theory and Its Applications,   1996
  • On the Weight Distribution of Algebraic Geometric Codes with Some High Degree Places,   1996
  • Computaion of the k-Error Linear Complexity of Binary Sequences with Period 2n(共著), Lecture Notes in Computer Science, Concurrency and Parallelism, Programming, Networking, and Security, Springer,   1996
  • On Fast Algorithms for k-Error Linear Complexity of Sequences over GF(Pm) with Period Pn, The Proceedings of the 19th Symposium on Information Theory and Its Applications,   1996
  • A Note on Residue Type Algebraic Geometric Codes with High Degree Places, The Proceeding of the 19th symposium on Information Theory and Ith Applications,   1996
  • Linear Complexity for One-Symbol Substitution of a Periodic Sequence over Z4, and Z8(共著), The proceeding of the 19th Symposium on Information Theory and Its Applications,   1996
  • On Decision of an Error Vector for Getting k-error Linear Complexity of Binary Sequences, The Proceeding of the 1997 Symposium on Cryptography and Information Security,   1997
  • On the Cost of Memory and Computation for Algorithms of k-Error Linear Complexity, Record of 1997 Joint Conference of Electrical and Electronics Engineersin Kyushu.,   1997
  • A Note on Algebraic Geometric Codes with High Degree Places over Some Curves, The proceedings of the 20th Symposium on Information Theory and Its Applications,   1997
  • A Note on Lower Bounds for the Minimum Distance of a Cyclic Code, The proceedings of the 20th Symposium on Information Theory and Its Applications,   1997
  • On Generalization of the Stamp-Martin Algorithm with Computing the Error Sequence, The proceedings of the 1998 Symposium on Gyptography and Information Security,   1998
  • An Algorithm for the k-Error Linear Complexity of Sequences over GF(Pm)with Period Pn, pa Prime(共著), The Proceedings of 1998 International Symposium on Information theory Its Applications,   1998
  • Complexity Analysis of Algorithms for the k-Error Linear Complexity, The Proceedings of the 21st Symposium on Information theomy and Its Applications,   1998
  • A Note on Lower Bound for the Minimum Distance of a Cyclic Code, The Proceedings of the 21st Symposium on Information Theory and Its Appicalions,   1998
  • A New Algorithm for the k-Error Linear Complexity of Sequences over GF(Pm) with Period Pn(共著), Sequences and Their Applications-Proceedings of SETA '98, Spriger London,   1999
  • On the Profile of the k-Error Linear Complexity and the Zero Sum Property for Sequences over GF(pm)with Period pn, Record of 2000 Joint Conference of Electrical and Electronics Engineering Kyushu,   2000
  • A Note on Decoding for Algebraic Geometric Codes with High Degree Places, The Proceedings of the 23rd Symposium on Information Theory and Its Applications,   2000
  • Further Note on the Feng-Rao Designed Minimum Distance for Cyclic Codes(共著), The Proceedings of the 23rd Symposium on Information Theory and Its Applications,   2000
  • Residue Type of Algebraic Geometric Codes with High Degree Places(共著), The Proceedings of the International Symposium on Information Theory and Its Applications,   2000
  • Linear Complexity of a Sequence Obtained from a GF(q)Sequence with Period qn by k-Symbol Substitution(共著), The Proceedings of the International Symposium on Information Theory and Its Applications,   2000
  • On decrease of k-error Linear Complexity and the Zero Sum Property for sequences over GF(pm)with Period pn, The Proceedings of the 2001 Symposium on Cryptography and Information Security,   2001

Misc

  • 巡回差集合より構成される定重み非線形符号に関する考察, KAIDA TAKAYASU, ZHENG JUNRU, 電気・情報関係学会九州支部連合大会講演論文集(CD-ROM), 68th, ROMBUNNO.13-2P-08,   2015 09 10 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201502203990452740
  • 巡回符号における共役根を用いたランク限界距離の計算について, TEI SHUNJO, KAIDA TAKAYASU, 電気・情報関係学会九州支部連合大会講演論文集(CD-ROM), 68th, ROMBUNNO.13-2P-09,   2015 09 10 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201502208357705061
  • A Note on Relationship between Program Readability and the T-Complexity in Java Language, TAKAHASHI KEIICHI, KAIDA TAKAYASU, 電子情報通信学会技術研究報告, 114, 34(IT2014 1-10), 11, 16,   2014 05 09 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201402272791814016
    Summary:We discuss about the program readability for some partial statements of program in the Java language. For 100 pieces of partial statements given by Buse et al., we calculate their T-complexity, T-information amount and T-entropy, called them three T-values, respectively. Then relationships between the human judgments and three T-values are shown in this paper. Moreover we consider two more pre-procedures for coding by the identifiers or token, such that coding procedures are set by every statements or by an universal dictionary.
  • On Linear Complexity of Constant-Weight Sequences over Extension Fields-With Correction for Numerical Examples Presented on SCIS2015-, KAIDA TAKAYASU, ZHENG JUNRU, TAKAHASHI KEIICHI, 電子情報通信学会技術研究報告, 114, 470(IT2014 62-101), 205, 210,   2015 02 23 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201502287387228752
  • A Note on Correlation Properties of Periodic Sequences over Extension Fields from a Cyclic Difference Set, KAIDA TAKAYASU, ZHENG JUNRU, TAKAHASHI KEIICHI, 電子情報通信学会技術研究報告, 115, 38(EMM2015 1-16), 31, 34,   2015 05 14 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201502211248469111
  • A Note on Correlation Properties of Periodic Sequences over Extension Fields from a Cyclic Difference Set, 戒田 高康, 鄭 俊如, 高橋 圭一, 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 115, 37, 31, 34,   2015 05 21 , http://ci.nii.ac.jp/naid/40020491272
  • 拡大体上の定重み符号とその性質に関する考察, KAIDA TAKAYASU, ZHENG JUNRU, TAKAHASHI KEIICHI, 情報理論とその応用シンポジウム予稿集(CD-ROM), 37th, ROMBUNNO.2.1.3,   2014 12 02 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201502288442435629
  • On the Calculation Method of Rank Bounded Distance with Conjugate Elements for Cyclic Codes, ZHENG JUNRU, KAIDA TAKAYASU, 情報理論とその応用シンポジウム予稿集(CD-ROM), 37th, ROMBUNNO.2.1.4,   2014 12 02 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201502221974879641
  • 巡回符号における行列演算を用いたランク限界について, TEI SHUNJO, KAIDA TAKAYASU, 電気・情報関係学会九州支部連合大会講演論文集(CD-ROM), 67th, ROMBUNNO.02-1A-04,   2014 09 11 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201402283327630729
  • A Note on the Complex Modulation with Zero Point from Constant-Weight and Multi-Valued Sequences, KAIDA TAKAYASU, ZHENG JUNRU, TAKAHASHI KEIICHI, 電子情報通信学会技術研究報告, 113, 483(IT2013 54-95), 221, 226,   2014 03 03 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201402291644816059
    Summary:For transmission of information, a method using the values in the constant-weight and multi-valued sequence that is proposed by the authors, with the complex-numbers over unit circle and zero point, and the spread spectrum transmission by these sequences are proposed. Moreover we discuss about the complex modulations in the auto-correlation and cross-correlation properties for some examples. The randomness of these sequences is also described.
  • GF(9)上の定重み符号を用いたゼロ点を含む複素系列について, KAIDA TAKAYASU, ZHENG JUNRU, TAKAHASHI KEIICHI, 電気・情報関係学会九州支部連合大会講演論文集(CD-ROM), 67th, ROMBUNNO.02-1A-03,   2014 09 11 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201402287098733280
  • On Applications for Complex Modulation by Constant-Weight and Multi-Valued Codes, KAIDA TAKAYASU, ZHENG JUNRU, TAKAHASHI KEIICHI, 電子情報通信学会技術研究報告, 114, 138(IT2014 11-40), 149, 152,   2014 07 10 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201402270275315647
    Summary:For transmission of information, a method using the values in the constant-weight and multi-valued code that is proposed by the authors, with the complex-numbers over the unit circle and the zero point is proposed. Moreover we discuss the complex modulation in the auto-correlation and the cross-correlation properties for some examples. The distance property among its codewords is also described.
  • A Note on Correlation Properties of Periodic Sequences over Extension Fields from a Cyclic Difference Set, 戒田 高康, 鄭 俊如, 高橋 圭一, 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 115, 38, 31, 34,   2015 05 21 , http://ci.nii.ac.jp/naid/40020491573
  • A Note on the Complex Modulation with Zero Point from Constant-Weight and Multi-Valued Sequences, KAIDA Takayasu, ZHENG Junru, TAKAAHSHI Keiichi, IEICE technical report. WBS, Wideband System, 113, 485, 221, 226,   2014 03 03 , http://ci.nii.ac.jp/naid/110009861678
    Summary:For transmission of information, a method using the values in the constant-weight and multi-valued sequence that is proposed by the authors, with the complex-numbers over unit circle and zero point, and the spread spectrum transmission by these sequences are proposed. Moreover we discuss about the complex modulations in the auto-correlation and cross-correlation properties for some examples. The randomness of these sequences is also described.
  • A Note on the Complex Modulation with Zero Point from Constant-Weight and Multi-Valued Sequences, KAIDA Takayasu, ZHENG Junru, TAKAAHSHI Keiichi, IEICE technical report. Information theory, 113, 483, 221, 226,   2014 03 03 , http://ci.nii.ac.jp/naid/110009861943
    Summary:For transmission of information, a method using the values in the constant-weight and multi-valued sequence that is proposed by the authors, with the complex-numbers over unit circle and zero point, and the spread spectrum transmission by these sequences are proposed. Moreover we discuss about the complex modulations in the auto-correlation and cross-correlation properties for some examples. The randomness of these sequences is also described.
  • On Linear Complexity of Constant-Weight Sequences over Extension Fields : With Correction for Numerical Examples Presented on SCIS2015, 戒田 高康, 鄭 俊如, 高橋 圭一, 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 114, 470, 205, 210,   2015 03 02 , http://ci.nii.ac.jp/naid/40020430132
  • On Linear Complexity of Constant-Weight Sequences over Extension Fields : With Correction for Numerical Examples Presented on SCIS2015, 戒田 高康, 鄭 俊如, 高橋 圭一, 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 114, 471, 205, 210,   2015 03 02 , http://ci.nii.ac.jp/naid/40020430514
  • On Linear Complexity of Constant-Weight Sequences over Extension Fields : With Correction for Numerical Examples Presented on SCIS2015, 戒田 高康, 鄭 俊如, 高橋 圭一, 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 114, 472, 205, 210,   2015 03 02 , http://ci.nii.ac.jp/naid/40020430919
  • Foreword: Special section on signal design and its applications in communications, Shinya Matsufuji, Pingzhi Fan, Tetsuya Kojima, Xiaohu Tang, Kwang Soon Kim, Hiromasa Habuchi, Takayasu Kaida, Takahiro Matsumoto, Hideyuki Torii, Satoshi Uehara, Kyeongcheol Yang, Udaya Parampalli, Hideki Yoshikawa, Yuta Ida, Shunsuke Araki, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E97A, 2540, 2541,   2014 01 01 , http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84924625479&origin=inward
  • On Improvement of Proposed Algorithm using DFT for Cyclic Codes, ZHENG JUNRU, KAIDA TAKAYASU, 情報理論とその応用シンポジウム予稿集(CD-ROM), 36th, ROMBUNNO.2.1.1,   2013 11 19 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201302217259998615
  • 巡回差集合から構成される定重み符号における符号語間距離に関する考察, 戒田高康, ZHENG Junru, 情報理論とその応用シンポジウム予稿集(CD-ROM), 36th, ROMBUNNO.2.1.2,   2013 11 19 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201302243598863576
  • On generalized constant-weight codes over GF(q) from a cyclic difference set and their properties, Takayasu Kaida, Junru Zheng, Keiichi Takahashi, Proceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014, 722, 726,   2014 01 01 , http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84920517483&origin=inward
    Summary:© 2014 IEICE. 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.
  • A Simple Note on Relationship between Program Readability and Its Some Complexities in Java Language, TAKAHASHI Keiichi, KAIDA Takayasu, IEICE technical report. Information theory, 113, 153, 55, 58,   2013 07 18 , http://ci.nii.ac.jp/naid/110009778274
    Summary:We discuss about the program readability for some partial statements of program in the Java language. Relationship between the human judgments for 100 pieces of partial statements given by Buse et al. and some complexities is shown, where the complexities are the entropy of information and the data compression rate by the bzip2.
  • 多値定重み系列におけるゼロ点を加えた複素相関に関する考察, 戒田高康, ZHENG Junru, 電気関係学会九州支部連合大会講演論文集(CD-ROM), 66th, ROMBUNNO.02-2P-13,   2013 09 13 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201302299200270185
  • On Applications for Complex Modulation by Constant-Weight and Multi-Valued Codes, 戒田 高康, 鄭 俊如, 高橋 圭一, 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, 114, 138, 149, 152,   2014 07 17 , http://ci.nii.ac.jp/naid/40020150920
  • A Note on Fast Algorithms of Shift Bound for Cyclic Codes, KAIDA Takayasu, ZHENG Junru, IEICE technical report. Information theory, 113, 58, 19, 22,   2013 05 17 , http://ci.nii.ac.jp/naid/110009768539
    Summary:The shift bound is one of well-known and good bounds for the designed minimum distance in cyclic codes. However there is no fast algorithm for calculating its real value with long code length. The authors proposed new lower bound for the designed minimum distance in cyclic codes approaching to the shift bound. In this paper we discuss about improvement of our proposed algorithm and constructing the independent set by the result of proposed algorithm.
  • 改良アルゴリズムにおける巡回符号の独立集合について, 鄭俊如, 戒田高康, 電気関係学会九州支部連合大会講演論文集(CD-ROM), 66th, ROMBUNNO.02-2P-14,   2013 09 13 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201302290235814776
  • A Note on Linear Complexity for Constant-Weight Codes, KAIDA TAKAYASU, ZHENG JUNRU, 電子情報通信学会技術研究報告, 112, 460(IT2012 62-111), 175, 179,   2013 02 28 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201302295020694844
    Summary:For cyclic codes (periodic sequences) over finite set from cyclic difference set proposed by authors, the Hamming weight of all codewords (one period of each sequences) is constant under some conditions. Moreover it known that almost codewords of the proposed code have highest linear complexity in view point of infinite periodic sequences from some examples. In this paper, we discuss about the linear complexity of these constant-weight codes from more numerical examples.
  • A Note on Linear Complexity for Constant-Weight Codes, KAIDA Takayasu, ZHENG Junru, IEICE technical report. Information theory, 112, 460, 175, 179,   2013 02 28 , http://ci.nii.ac.jp/naid/110009712337
    Summary:For cyclic codes (periodic sequences) over finite set from cyclic difference set proposed by authors, the Hamming weight of all codewords (one period of each sequences) is constant under some conditions. Moreover it known that almost codewords of the proposed code have highest linear complexity in view point of infinite periodic sequences from some examples. In this paper, we discuss about the linear complexity of these constant-weight codes from more numerical examples.
  • A Note on Linear Complexity for Constant-Weight Codes, KAIDA Takayasu, ZHENG Junru, IEICE technical report. WBS, Wideband System, 112, 462, 175, 179,   2013 02 28 , http://ci.nii.ac.jp/naid/110009712222
    Summary:For cyclic codes (periodic sequences) over finite set from cyclic difference set proposed by authors, the Hamming weight of all codewords (one period of each sequences) is constant under some conditions. Moreover it known that almost codewords of the proposed code have highest linear complexity in view point of infinite periodic sequences from some examples. In this paper, we discuss about the linear complexity of these constant-weight codes from more numerical examples.
  • On some algorithms on the proposed lower bound of the designed minimum distance for cyclic codes, Takayasu Kaida, Junru Zheng, 2013 19th Asia-Pacific Conference on Communications, APCC 2013, 520, 524,   2013 01 01 , 10.1109/APCC.2013.6766003, http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84902326556&origin=inward
    Summary:The minimum distance for linear codes is one of the important parameters. The shift bound is a good lower bound of the minimum distance for cyclic codes, Reed-Muller codes and geometric Goppa codes. It is necessary to construct the maximum number of the independent set for the calculation of the shift bound. However, its computational complexity is very large, because the construction of the independent sets is not unique. The authors proposed an algorithm for calculation of the independent set and new lower bound using the discrete Fourier transform in 2010. In this paper we give simple modification and new recurrent algorithms to improve the original algorithm. © 2013 IEEE.
  • On Constant-Weight Multi-Valued Sequences from Cyclic Difference Sets, KAIDA TAKAYASU, ZHENG JUNRU, IEICE Trans Fundam Electron Commun Comput Sci (Inst Electron Inf Commun Eng), E96-A, 1, 171-176 (J-STAGE),   2013 , 10.1587/transfun.E96.A.171, http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201302272758293895
  • On Properties of Proposed Algorithm for Cyclic Codes, ZHENG JUNRU, KAIDA TAKAYASU, 情報理論とその応用シンポジウム予稿集(CD-ROM), 35th, ROMBUNNO.6.1.1,   2012 12 04 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201302218367645474
  • 巡回符号の最小距離に対する提案した下界とHartmann‐Tzeng限界に関する考察, 戒田高康, ZHENG Junru, 情報理論とその応用シンポジウム予稿集(CD-ROM), 35th, ROMBUNNO.6.1.2,   2012 12 04 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201302292334652551
  • On Algorithms of the Proposed and Well-Known Lower Bounds for Cyclic Codes, KAIDA TAKAYASU, ZHENG JUNRU, 電気関係学会九州支部連合大会講演論文集(CD-ROM), 65th, ROMBUNNO.05-1P-06,   2012 09 14 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201202271984487585
  • Legitimation of the use of fancy tools, Reports of School of Humanity-Oriented Science and Engineering, Kinki University, 16, 8, 14,   2012 07
  • A Note on Cyclic-Equivalent Codewords for Constant-Weight Codes from Cyclic Difference Sets, KAIDA Takayasu, ZHENG Junru, Technical report of IEICE. ISEC, 111, 455, 237, 240,   2012 02 23 , http://ci.nii.ac.jp/naid/110009545785
    Summary:We proposed a method for constructing constant-weight and multi-valued code from the cyclic difference sets by generalization of the method in binary case proposed by N.Li, X.Zeng and L.Hu in 2008. In this paper we give some properties about sets of such codewords and it is shown that a set of constant weight sequences over Z_5 with length 21 from the (21,5,1)-cyclic difference set have almost highest linear complexities and good profiles of all sequences' linear complexities. It is pointed out that this set also has good value distributions and almost highest linear complexities by a numerical example over Z_5 with length 21. And it is shown that each elements except zero appear same times in codes by our proposed method.
  • 巡回符号における提案アルゴリズムに関する一考察, 鄭俊如, 戒田高康, 電気関係学会九州支部連合大会講演論文集(CD−ROM), 65th, ROMBUNNO.05-1P-07,   2012 09 14 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201202267607718192
  • A Note on Cyclic-Equivalent Codewords for Constant-Weight Codes from Cyclic Difference Sets, KAIDA Takayasu, ZHENG Junru, IEICE technical report. Information theory, 111, 454, 237, 240,   2012 02 23 , http://ci.nii.ac.jp/naid/110009545560
    Summary:We proposed a method for constructing constant-weight and multi-valued code from the cyclic difference sets by generalization of the method in binary case proposed by N.Li, X.Zeng and L.Hu in 2008. In this paper we give some properties about sets of such codewords and it is shown that a set of constant weight sequences over Z_5 with length 21 from the (21,5,1)-cyclic difference set have almost highest linear complexities and good profiles of all sequences' linear complexities. It is pointed out that this set also has good value distributions and almost highest linear complexities by a numerical example over Z_5 with length 21. And it is shown that each elements except zero appear same times in codes by our proposed method.
  • A Note on Cyclic-Equivalent Codewords for Constant-Weight Codes from Cyclic Difference Sets, 111, 454, 237, 240,   2012 03 01 , http://ci.nii.ac.jp/naid/40019225394
  • A Note on Cyclic-Equivalent Codewords for Constant-Weight Codes from Cyclic Difference Sets, KAIDA Takayasu, ZHENG Junru, IEICE technical report. WBS, Wideband System, 111, 456, 237, 240,   2012 02 23 , http://ci.nii.ac.jp/naid/110009545269
    Summary:We proposed a method for constructing constant-weight and multi-valued code from the cyclic difference sets by generalization of the method in binary case proposed by N.Li, X.Zeng and L.Hu in 2008. In this paper we give some properties about sets of such codewords and it is shown that a set of constant weight sequences over Z_5 with length 21 from the (21,5,1)-cyclic difference set have almost highest linear complexities and good profiles of all sequences' linear complexities. It is pointed out that this set also has good value distributions and almost highest linear complexities by a numerical example over Z_5 with length 21. And it is shown that each elements except zero appear same times in codes by our proposed method.
  • A Note on Cyclic-Equivalent Codewords for Constant-Weight Codes from Cyclic Difference Sets, KAIDA Takayasu, ZHENG Junru, 電子情報通信学会技術研究報告. ISEC, 情報セキュリティ, 111, 455, 237, 240,   2012 02 23 , http://ci.nii.ac.jp/naid/10031149568
  • A Note on Cyclic-Equivalent Codewords for Constant-Weight Codes from Cyclic Difference Sets, KAIDA Takayasu, ZHENG Junru, 電子情報通信学会技術研究報告. IT, 情報理論, 111, 454, 237, 240,   2012 02 23 , http://ci.nii.ac.jp/naid/10031149127
  • Construction of Independent Set and Its Application for Designed Minimum Distance, ZHENG JUNRU, KAIDA TAKAYASU, IEICE Trans Fundam Electron Commun Comput Sci (Inst Electron Inf Commun Eng), E95-A, 12, 2107-2112 (J-STAGE),   2012 , 10.1587/transfun.E95.A.2107, http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201302290885926170
  • On linear recurrences and their applications, Reports of School of Humanity-Oriented Science and Engineering, Kinki University, 15, 13, 20,   2011 12
  • A Note on Relationship between Proposed Lower Bound and Well-Known Lower Bounds for Cyclic Codes, ZHENG JUNRU, KAIDA TAKAYASU, 情報理論とその応用シンポジウム予稿集(CD-ROM), 34th, ROMBUNNO.6.1.2,   2011 11 22 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201202299086274674
  • Record of the second and third interdisciplinary seminars, Reports of School of Humanity-Oriented Science and Engineering, Kinki University, 14, 64, 72,   2011 07
  • A Note on the Partition by Defining Set and the Weight Distributions for Cyclic Codes (Part 2), KAIDA Takayasu, ZHENG Junru, IEICE technical report. Information theory, 111, 51, 37, 40,   2011 05 13 , http://ci.nii.ac.jp/naid/110008725649
    Summary:The partition of cyclic codes defined by the defining sets and concept of a sequence of the defining set are induced. Then we discuss about a method for the weight distribution using our proposed algorithm for lower bound of the minimum distance and the partition for cyclic codes. In this paper, a lower bound of the weight distribution for a numerical example is given.
  • 巡回符号における定義集合と符号語の重みに関する考察, 戒田高康, ZHENG Junru, 情報理論とその応用シンポジウム予稿集(CD−ROM), 34th, ROMBUNNO.6.1.1,   2011 11 22 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201202283318588979
  • A Note on the Partition by Defining Set and the Weight Distributions for Cyclic Codes, KAIDA Takayasu, ZHENG Junru, Technical report of IEICE. ISEC, 110, 443, 65, 68,   2011 02 24 , http://ci.nii.ac.jp/naid/110008689675
    Summary:The partition of cyclic codes defined by the defining sets and concept of a sequence of the defining set are induced. Then we discuss about a method for the weight distribution using our proposed algorithm for lower bound of the minimum distance and the partition for cyclic codes.
  • 無歪みネットワークコーディングにおける行列表現に関する考察, 戒田高康, ZHENG Junru, 電気関係学会九州支部連合大会講演論文集(CD−ROM), 64th, ROMBUNNO.09-2A-10,   2011 09 16 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201102271686071662
  • A Note on the Partition by Defining Set and the Weight Distributions for Cyclic Codes, KAIDA Takayasu, ZHENG Junru, IEICE technical report. Information theory, 110, 442, 65, 68,   2011 02 24 , http://ci.nii.ac.jp/naid/110008689019
    Summary:The partition of cyclic codes defined by the defining sets and concept of a sequence of the defining set are induced. Then we discuss about a method for the weight distribution using our proposed algorithm for lower bound of the minimum distance and the partition for cyclic codes.
  • ある3元巡回符号における独立集合の構成について, 鄭俊如, 戒田高康, 電気関係学会九州支部連合大会講演論文集(CD−ROM), 64th, ROMBUNNO.09-2A-11,   2011 09 16 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201102270780906593
  • A Note on the Partition by Defining Set and the Weight Distributions for Cyclic Codes, KAIDA Takayasu, ZHENG Junru, IEICE technical report. WBS, Wideband System, 110, 444, 65, 68,   2011 02 24 , http://ci.nii.ac.jp/naid/110008688443
    Summary:The partition of cyclic codes defined by the defining sets and concept of a sequence of the defining set are induced. Then we discuss about a method for the weight distribution using our proposed algorithm for lower bound of the minimum distance and the partition for cyclic codes.
  • Numerical Experiments on Proposed Lower Bound of Minimum Distance for Cyclic Codes, ZHENG JUNRU, KAIDA TAKAYASU, 情報理論とその応用シンポジウム予稿集(CD-ROM), 33rd, ROMBUNNO.16.2,   2010 11 23 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201102283459373197
  • 巡回差集合により構成される定重み符号の性質に関する考察, 戒田高康, ZHENG Junru, 情報理論とその応用シンポジウム予稿集(CD−ROM), 33rd, ROMBUNNO.16.1,   2010 11 23 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201102201396639691
  • A Note on the Shift Bound for Cyclic Codes by the DFT, ZHENG JUNRU, KAIDA TAKAYASU, IEICE Trans Fundam Electron Commun Comput Sci (Inst Electron Inf Commun Eng), E93-A, 11, 1918, 1922,   2010 11 01 , 10.1587/transfun.E93.A.1918, http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201002257526227739
  • A set of sequences over Z5 with period 21 including almost highest linear complexities, Takayasu Kaida, Junru Zheng, IEEE Information Theory Workshop 2010, ITW 2010,   2010 07 27 , 10.1109/ITWKSPS.2010.5503132, http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=77954830430&origin=inward
    Summary:A method of construction for non-binary periodic sequence with constant weight from cyclic difference set is proposed. Two numerical examples are given, and their distribution and some Hamming distance between self-cyclic shift and crosscyclic shift of two sequences are evaluated. For a set of sequences over Z5 with period 21, we show that its elements have almost the highest linear complexities from second numerical example.
  • A Note on Bounds of Minimum Distance and Decoding Methods for Cyclic Codes by DFT Matrix, KAIDA Takayasu, ZHENG Junru, IEICE technical report. Information theory, 110, 43, 31, 34,   2010 05 14 , http://ci.nii.ac.jp/naid/110008000501
    Summary:In this report, We give alternative proofs for the BCH boud, the Hertmann-Tzeng bound and the shift bound by the discrete Fourier transform (DFT) matrix. Moreover an outline of an algebraic decoding method for cyclic codes up to the half of the bounds by the DFT matrix is shown.
  • 多値系列における複素およびハミング相関特性に関する考察, 戒田高康, 電気関係学会九州支部連合大会講演論文集(CD−ROM), 63rd, ROMBUNNO.10-2P-09,   2010 09 09 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201002296362495147
  • 巡回符号における離散フーリエ変換を用いた最小距離の計算法, 鄭俊如, 戒田高康, 電気関係学会九州支部連合大会講演論文集(CD−ROM), 63rd, ROMBUNNO.10-2P-10,   2010 09 09 , 10.11527/jceeek.2010.0.633.0, http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201002240677226700
  • On Constant Weight Codes with Large Linear Complexity from Cyclic Difference Set, KAIDA Takayasu, Technical report of IEICE. ISEC, 109, 445, 409, 412,   2010 02 25 , http://ci.nii.ac.jp/naid/110008001847
    Summary: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.
  • On Constant Weight Codes with Large Linear Complexity from Cyclic Difference Set, KAIDA Takayasu, IEICE technical report. Information theory, 109, 444, 409, 412,   2010 02 25 , http://ci.nii.ac.jp/naid/110008000485
    Summary: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.
  • On Constant Weight Codes with Large Linear Complexity from Cyclic Difference Set, KAIDA Takayasu, IEICE technical report. WBS, Wideband System, 109, 446, 409, 412,   2010 02 25 , http://ci.nii.ac.jp/naid/110007999462
    Summary: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 complexity and its profiles.
  • A New Method for Calculation of Minimum Distance by DFT for Cyclic Codes, ZHENG JUNRU, KAIDA TAKAYASU, 電気学会電子・情報・システム部門大会講演論文集(CD-ROM), 2010, ROMBUNNO.MC3-5,   2010 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201002243014461771
  • A note on constant weight sequences over q-ary from cyclic difference sets, Takayasu Kaida, Junru Zheng, Proceedings of the 4th International Workshop on Signal Design and Its Applications in Communications, IWSDA'09, 112, 113,   2009 12 01 , 10.1109/IWSDA.2009.5346405, http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=74549204420&origin=inward
    Summary:A method of construction for non-binary periodic sequences from the cyclic difference set is proposed. Two numerical examples are given, and their value distributions and some Hamming distances between self-cyclic shift and cross-cyclic shift of two sequences are evaluated. ©2009 IEEE.
  • On Boston bound for cyclic codes by DFT with unknown elements, Junru Zheng, Takayasu Kaida, Proceedings of the 4th International Workshop on Signal Design and Its Applications in Communications, IWSDA'09, 108, 111,   2009 12 01 , 10.1109/IWSDA.2009.5346404, http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=74549198650&origin=inward
    Summary:The Boston bound is defined by the subset of defining set for cyclic codes. The authors proposed new simple derivation for the BCH bound, the HT bound and the shift bound, using the discrete Fourier transform (DFT) and the Blahut theorem. In this paper, we consider the Boston bound for cyclic codes by the DFT. ©2009 IEEE.
  • q元定重み符号の性質に関する一考察, 戒田高康, ZHENG Junru, 情報理論とその応用シンポジウム予稿集(CD-ROM), 32nd, ROMBUNNO.T21-1,   2009 11 24 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=201002223691991948
  • An Action on Project-Oriented Information Education by Collaboration with the Society-First Report of Applications for the Challenge-Project by Iizuka City-, KAIDA TAKAYASU, 近畿大学産業理工学部研究報告, 0, 11, 31, 33,   2009 11 22 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902268929305811
    Summary:[Abstruct] For information education in point of view by the JABEE, the engineering-design is one of most important checking-issues. This repot contains the introduction and some statistic data about the challenge-project by Iizuka City and, our effective results and remaining problems by some applications for this grant.
  • 巡回符号における符号語の重みの計算法に関する考察, 鄭俊如, 戒田高康, 電気関係学会九州支部連合大会講演論文集(CD-ROM), 62nd, 0, ROMBUNNO.10-2P-08, 487,   2009 09 10 , 10.11527/jceeek.2009.0.487.0, http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902250320782374
    Summary:定義集合によって定まる巡回符号において,その符号語を用いてDFT行列を定義できる.Blahut定理によれば,DFT行列のランクとその符号語の重みが等しいことが知られている.本稿では,DFT行列の巡回性及び共役性を用いて,その部分行列のランクを計算することにより,符号語の重みを評価する手法について考察する.
  • 巡回差集合により構成されるq元定重み系列の線形複雑度に関する考察, 戒田高康, 鄭俊如, 電気関係学会九州支部連合大会講演論文集(CD-ROM), 62nd, ROMBUNNO.10-2P-07,   2009 09 10 , 10.11527/jceeek.2009.0.486.0, http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902210873288805
  • 巡回符号におけるDFT行列を用いたRoos限界までの復号法に関する考察, 戒田高康, ZHENG Junru, 情報理論とその応用シンポジウム予稿集(CD-ROM), 31st, ROMBUNNO.7.1.5,   2008 09 30 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902256482414768
  • 巡回差集合によるGF(q)上の定重み符号の構成について, 戒田高康, 鄭俊如, 電気関係学会九州支部連合大会講演論文集(CD-ROM), 61st, ROMBUNNO.06-2P-09,   2008 09 10 , 10.11527/jceeek.2008.0.319.0, http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902238829925840
  • DFTを用いた2元巡回符号におけるBoston限界の考察, 鄭俊如, 戒田高康, 電気関係学会九州支部連合大会講演論文集(CD-ROM), 61st, ROMBUNNO.06-2P-10,   2008 09 10 , 10.11527/jceeek.2008.0.320.0, http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902223710289736
  • A decoding method up to the Hartmann-Tzeng bound using the DFT for cyclic codes, Takayasu Kaida, Junru Zheng, 2007 Asia-Pacific Conference on Communications, APCC, 409, 412,   2007 12 01 , 10.1109/APCC.2007.4433457, http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=50249177030&origin=inward
    Summary:We consider a decoding method for cyclic codes up to the Hartmann-Tzeng bound using the discrete Fourier transform. Indeed we propose how to make a submatrix of the circulant matrix from an error vector for this decoding method. Moreover an example of a binary cyclic code, which could not be corrected by BCH decoding but be correctable by proposed decoding, is given. It is expected that this decoding method induces universal understanding for decoding method up to the Roos bound and the shift bound. ©2007 IEEE.
  • On shift bound for cyclic codes by DFT with unknown elements, Junru Zheng, Takayasu Kaida, IWSDA 07 - 3rd International Workshop on Signal Design and Its Applications in Communications, 114, 117,   2007 12 01 , 10.1109/IWSDA.2007.4408337, http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=48049113900&origin=inward
    Summary:The shift bound is a good lower bound of the minimum distance for cyclic codes, Reed-Muller codes and geometric Goppa codes. In this paper we consider cyclic codes defined by defining sequence and new simple derivation using the discrete Fourier transform with unknown elements and the Blahut theorem is shown. Moreover two examples of binary cyclic codes are given. © 2007 IEEE.
  • E‐系列の奇数シフト自己相関値に関する考察, 戒田高康, 電気関係学会九州支部連合大会講演論文集(CD-ROM), 60th, 0, 05-1P-05, 170,   2007 09 10 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902232342109454
  • Evaluation of a bound by DFT for cyclic codes, ZHENG Junru, KAIDA Takayasu, Journal of Kyushu Kyoritsu University Research Center, 1, 0, 63, 66,   2008 02 , http://ci.nii.ac.jp/naid/110007144891
    Summary:The Schaub bound is one of well-known lower bounds of the minimum distance for a cyclic code, and de-fined from its defining set. In 2003, this bound was improved and an algorithm for this improved bound was given by F.Ponchio and M.Sala. We give some properties of the Schaub bound and its improvements in order to investigate a relationship with the Roos bound and the shift bound by showing many numerical examples for binary and ternary cyclic codes with short length, and search a fast algorithm for the Schaub bound and the improved Schaub bound. We claim one conjecture that the value from ...
  • 巡回符号におけるBoston限界とBCH限界の関係に関する考察, 鄭俊如, 戒田高康, 電気関係学会九州支部連合大会講演論文集(CD-ROM), 60th, 0, 05-1P-06, 171,   2007 09 10 , 10.11527/jceeek.2007.0.171.0, http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902217010583129
  • A Note on Decoding using an Equivalent Code for Cyclic Codes, KAIDA Takayasu, ZHENG Junru, 情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications, 29, 1, 13, 16,   2006 11 28 , http://ci.nii.ac.jp/naid/10022580991
  • 楕円曲線擬似乱数系列に関する一考察, 戒田高康, 電気関係学会九州支部連合大会講演論文集(CD-ROM), 59th, 0, 02-1A-15, 15,   2006 09 21 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902238907200610
  • 巡回符号におけるShift限界とSchaubPlus限界の関係に関する予想, 鄭俊如, 戒田高康, 電気関係学会九州支部連合大会講演論文集(CD-ROM), 59th, 0, 02-1A-16, 16,   2006 09 21 , 10.11527/jceeek.2006.0.16.0, http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902209418195060
  • On Construction of Periodic Sequence on Algebraic Curve over Finite Field, KAIDA Takayasu, Technical report of IEICE. ISEC, 105, 396, 25, 28,   2005 11 08 , http://ci.nii.ac.jp/naid/110004020723
    Summary:In this paper, a construction method for a periodic sequence over a finite field F' from rational points on a algebraic curve over an extension filed F of F' is given. This proposed method uses cyclic property of rational points and trace function, and gives sequences with larger period than well-known conventional methods such as the methods with shift registers. Moreover three examples over elliptic curves and their evaluation by the balance test are shown. Unfortunately we show a few examples with good balance property because of small number of examples with small periods.
  • On Relation between the Defining Set and the Weight Distribution for Cyclic Codes, KAIDA Takayasu, ZHENG Junru, IMAMURA Kyoki, 情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications, 27, 2, 683, 685,   2005 12 14 , http://ci.nii.ac.jp/naid/10014281420
  • On the generalized lauder-paterson algorithm and profiles of the k-error linear complexity for exponent periodic sequences, Takayasu Kaida, Lecture Notes in Computer Science, 3486, 166, 178,   2005 09 27 , http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=24944433886&origin=inward
    Summary:The Lauder-Paterson algorithm gives the profile of the k-error linear complexity for a binary sequence with period 2 n. In this paper a generalization of the Lauder-Paterson algorithm into a sequence over GF(p m) with period p n, where p is a prime and m, n are positive integers, is proposed. We discuss memory and computation complexities of proposed algorithm. Moreover numerical examples of profiles for balanced binary and ternary exponent periodic sequences, and proposed algorithm for a sequence over GF(3) with period 9(= 3 2) are given. © Springer-Verlag Berlin Heidelberg 2005.
  • A Note on Relation between Linear Complexity and Minimum Distance for Cyclic Codes, Zheng Junru, Kaida Takayasu, Record of JCEEE in Kyushu, 2005, 0, 350, 350,   2005 , http://ci.nii.ac.jp/naid/130004608385
  • On Construction of Periodic Sequences on Elliptic Curves over Finite Fields, Kaida Takayasu, Record of JCEEE in Kyushu, 2005, 0, 351, 351,   2005 , http://ci.nii.ac.jp/naid/130004608386
  • 巡回符号における定義集合と重み分布の関係に関する考察, 戒田高康, ZHENG J, 今村恭己, 情報理論とその応用シンポジウム予稿集, 27th, Vol.2, 683, 685,   2004 12 14 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902260815686490
  • On Construction of Periodic Sequence on Algebraic Curve over Finite Field, KAIDA Takayasu, IEICE technical report. Office Information Systems, 105, 398, 25, 28,   2005 11 08 , http://ci.nii.ac.jp/naid/110004018560
    Summary:In this paper, a construction method for a periodic sequence over a finite field F' from rational points on a algebraic curve over an extension filed F of F' is given. This proposed method uses cyclic property of rational points and trace function, and gives sequences with larger period than well-known conventional methods such as the methods with shift registers. Moreover three examples over elliptic curves and their evaluation by the balance test are shown. Unfortunately we show a few examples with good balance property because of small number of examples with small periods.
  • An Improvement of the Hartmann-Tzeng Bound for Binary Cyclic Codes with Short Length, Kaida Takayasu, Zheng Junru, Record of JCEEE in Kyushu, 2004, 0, 405, 405,   2004 , http://ci.nii.ac.jp/naid/130004607480
  • An Evaluation for Pseudo-Random Sequences by the k-Error Linear Complexity and its Fast Algorithms., KAIDA TAKAYASU, 情報処理学会シンポジウム論文集, 2003, 15, 623, 628,   2003 10 29 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902292241761641
  • On Improvement of the Hartmann-Tzeng Bound with Independent Sets, KAIDA Takayasu, ZHENG Junru, 情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications, 26, 2, 461, 464,   2003 12 15 , http://ci.nii.ac.jp/naid/10013957763
  • Linear Complexities of Periodic Sequences Obtained from Sequences over Z4 and Z8 by One-Symbol Substitution, Tsutomu Moriuchi, Satoshi Uehara, Takayasu Kaida, Kyoki Imamura, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E86-A, 1285, 1293,   2003 05 01 , http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=0142007181&origin=inward
    Summary:In this paper, we will show that some families of periodic sequences over Z4 and Z8 with period multiple of 2r - 1 generated by r-th degree basic primitive polynomials assorted by the root of each polynomial, and give the exact distribution of sequences for each family. We also point out such an instability as an extreme increase of their linear complexities for the periodic sequences by one-symbol substitution, i.e., from the minimum value to the maximum value, for all the substitutions except one.
  • On Independent Sets for Cyclic Codes with the Shift Bound Strictly Larger than the Hartmann-Tzeng Bound, KAIDA Takayasu, ZHENG Junru, IEICE technical report. Information theory, 103, 308, 49, 52,   2003 09 10 , http://ci.nii.ac.jp/naid/110003202755
    Summary:Well-known lower bounds such as the BCH bound, the Hartmann-Tzeng (HT) bound and the Roos bound, of the minimum distance for cyclic codes are recalled. The concept of an independent set of a cyclic code is very important for definition and calculation of the shift bound, so we discuss some ways to make such an independent set. It was shown that the shift bound of any cyclic code is larger than or equal to the HT bound of this cyclic code. This theorem was proved by giving a way to make an independent set of this cyclic code. However this way cannot take an independent set beyond the HT boun...
  • Feng‐Rao距離を越えてFeng‐Rao復号可能な巡回符号の例について, 戒田高康, ZHENG J, 今村恭己, 情報理論とその応用シンポジウム予稿集, 25th, Vol.2, 483, 486,   2002 12 10 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902122434991552
  • On Complexities for Sequences and Their Computing Algorithms., KAIDA TAKAYASU, 電子情報通信学会技術研究報告, 101, 490(SST2001 48-54), 5, 12,   2001 12 13 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902167267821260
  • Some Properties of Sequences over Integer Residue Rings Modulo q,q=pm and p a Prime, 森内 勉, 今村 恭己, 戒田 高康, Research reports/Yatsushiro National College of Technology, 0, 24, 37, 48,   2002 03 , http://ci.nii.ac.jp/naid/40004582674
  • On Complexities for Sequences and Their Computing Algorithms, KAIDA Takayasu, Technical report of IEICE. SST, 101, 490, 5, 12,   2001 12 06 , http://ci.nii.ac.jp/naid/110003290632
    Summary:Pseudo-random sequences are important in the fields of communications and computer science. In this paper definitions of linear complexity(LC), maximum order complexity(MOC)and κ-error linear complexity(κ-LC), some properties of them for tipical sequences, and their computing algorithms are given. Especially, properties of LC for minimum-changed sequences from M-sequences and properties of κ-LC for peridic sequnces with zero sum property are shown.
  • A Note on Decoding for Algebraic Geometric Codes with High Degree Places (Part 2), KAIDA Takayasu, IMAMURA Kyoki, 情報理論とその応用シンポジウム予稿集 = The proceedings of the Symposium on Information Theory and Its Applications, 24, 1, 203, 206,   2001 12 04 , http://ci.nii.ac.jp/naid/10020377098
  • On the duality of algebraic geometric codes with high degree places, T. Kaida, K. Imamura, IEEE International Symposium on Information Theory - Proceedings, 309,   2001 09 12 , http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=0034865321&origin=inward
    Summary:Definitions for function type and residue type of algebraic geometric (AG) codes with high degree places, which are generalized constructions of conventional AG codes, are given. We show that the function type AG code is the dual code of the residue type AG code constructed by same divisors.
  • 有理関数体におけるNiederreiter等による高次の座を用いた代数幾何符号の構成, 戒田高康, 今村恭己, 電気関係学会九州支部連合大会講演論文集, 52nd, 624,   1999 10 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902137938320966
  • Value distribution of linear complexity for p-ary periodic sequences with period pn, p a prime, Satoshi Uehara, Kyoki Imamura, Takayasu Kaida, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E80-A, 920, 921,   1997 12 01 , http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=0031144948&origin=inward
    Summary:Firstly we show a useful property of the fast algorithm for computing linear complexities of p-ary periodic sequences with period pn (p: a prime). Secondly the property is successfully applied to obtain the value distribution of the linear complexity for p-ary periodic sequences with period pn.
  • Memory quantity and calculation quantity in a k-error linear complexity calculation method., KAIDA TAKAYASU, UEHARA SATOSHI, IMAMURA YASUKI, 電気関係学会九州支部連合大会講演論文集, 50th, 115,   1997 10 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902140686191948
  • Computation of the k-Error Linear Complexity of Binary Sequences with Period 2^n, Kaida Takayasu, Uehara Satoshi, Imamura Kyoki, Technical report of IEICE. ISEC, 96, 237, 25, 32,   1996 09 06 , http://ci.nii.ac.jp/naid/110003296903
    Summary:The k-error linear complexity (k-LC) of sequences is a very natural and useful generalization of the linear complexity (LC) which has been conveniently used as a measure of unpredictability of pseudo-random sequences, i.e., difficulty in recovering more of a sequence from a short, captured segment. However effective method for computing the k-LC has been known only for binary sequences with period 2^n (Stamp and Martin, 1993). This paper gives an alternative derivation of the Stamp-Martin algorithm. Our method can be easily generalized to sequences over GF(p^m) with period p^n, p an odd pri...
  • 最小変更が最大のLinear Complexityを持つ周期系列, 今村恭己, 戒田高康, 上原聡, 電気関係学会九州支部連合大会講演論文集, 47th, 14,   1994 09 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902154032324818
  • Value Distribution of Linear Complexity for p-ary Periodic Sequences with Period pn, p a Prime., UEHARA SATOSHI, KAIDA TAKAYASU, IMAMURA KYOKI, 電子情報通信学会技術研究報告, 94, 34(IT94 1-8), 7, 10,   1994 05 16 , http://jglobal.jst.go.jp/detail.php?from=API&JGLOBAL_ID=200902137397913497
  • Value distribution of lincar complexity for P-ary periodic sequences with period p^n,p a prime, Uehara Satoshi, Kaida Takayasu, Imamura Kyoki, IEICE technical report. Information theory, 94, 34, 7, 10,   1994 05 16 , http://ci.nii.ac.jp/naid/110003197419
    Summary:We will show that number of p-axy sequences with period p^n and linear complexity(LC);L is(p-1)- p^L-n-1> using a fast algorithm for calculating their LC.Where the algorithm is got by generalizing Games-Chan′s one.Secondly we get that many sequences with period p^n have LC which axe close to their period and the rate of sequences with maximum LC is (p-1), p or more.
  • 35. Takayasu Kaida, Junru Zheng, “On independent sets for cyclic codes with the shift bound strictly larger then the Hartmann-Tzeng bound”, IEICE Technical Report Information Theory, IT2003-49, pp.49-52,   2003 09
  • 8. Tsutomu Moriuchi, Satoshi Uehara, Takayasu Kaida and Kyoki Imamura, “Linear complexities of periodic sequences obtained from sequences over Z4 and Z8 by one-symbol substitution”, IEICE Transaction EA, Vol.E86-A, pp.1285-1293,   2003 05
  • Junru Zheng,Takayasu Kaida and Kyoki Imamura,"The Feng-Rao designed minimum distance of binary linear codes and cyclic codes", Advances Signal Processing for Communication Systemes, 13,   2002
  • Takayasu Kaida,Satoshi Uehara and Kyoki Imamura,"On the profile for the k-error linear complexity and the zero sum property for sequences over GF(pm) with period pn, Suquences and their Applications-Proceedings of Sequences and Their Applications(SETA2001), 218-227,   2001
  • Junru Zheng,Takayasu Kaida and Kyoki Imamura,"The Feng-Rao designed minimum distance of binary linear codes does not have an odd number except one", Suquence Design and Applications for CDMA Systems, 146-149,   2001
  • Takayasu Kaida,Satoshi Uehara and Kyoki Imamura,"A new algorithm for thek-error linear complexity of sequences over GF(pm) with period pn", Suquences and their Applications-Proceedings of Sequences and Their Applications(SETA'98), 284-296,   1999
  • Takayasu Kaida,Satoshi Uehara and Kyoki Imamura,"An algorithm for the k-error linear complexity of sequences over GF(pm) with period pn,p a prime", Information and Computation, 151, 134-147,   1999
  • On Algorithms for the k-Error Linear Complexity of Sequences over GF(Pm) with Period Pn,   1999
  • An Algorithm for the k-Error Linear Complexity of Sequences over GF(Pm)with Period Pn, Pa Prime(共著), Information and Computation, Academic Press, 151, 1/2, 134, 147,   1999 , 10.1006/inco.1998.2768
  • Value Distribution of Linear Complexity for p-Ary Periodic Sequences with Period Pn, P a Prime. (共著), IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E80-A, 5, 920, 921,   1997
  • Takayasu Kaida,Satoshi Uehara and Kyoki Imamura,"Computation of the k-error complexity of binary sequences with period 2n", Lecture Notes in Computer Science, 1179, 182-191,   1996
  • Algebraic Geometric Codes with High Degree Places,   1996
  • The method for Computing the Linear Complexity of Pseudo-random Sequences,   1994
  • On Construction of Algebraic Geometric Codes with High Degree Places

Awards & Honors

  •   2007 10 , IEEE Asia-Pacific Conference on Communications, Best Paper Award (IEEE APCC2 007), A decoding method up to the Hartmann-Tzeng bound usuing the DFT for cyclic codes

Research Grants & Projects

  • Study on Algebraic Geometric Codes
  • Study on Sequences