Art

J-GLOBAL ID：201602214746394400   Reference number：16A0004087

On the Rank Bounded Distance with Conjugate Elements for Cyclic Codes

巡回符号用の共役要素を有する階層有界距離(rank bounded distance)について

Author (2)： ZHENG Junru (Dep. of Human Dev., Fac. of Humanities, Kyushu Women’s Univ.) ,  KAIDA Takayasu (Dep. of Information and Computer Sciences, Fac. of Humanity-Oriented Sci. and Engineering, Kinki Univ.)
Material： IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Web)  (IEICE Trans Fundam Electron Commun Comput Sci (Web))
Volume： E98.A  Issue： 12  Page： 2476-2479 (J-STAGE)  Publication year： 2015 
JST Material Number： U0466A  ISSN： 1745-1337  Document type： Article
Article type： 短報  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *cyclic code ,  *conjugation ,  *limit ,  algorithm ,  Fourier transformation ,  distance ,  definition ,  calculation algorithm ,  minimum distance ,  *bounded ,  DFT

JST classification (1)： Code theory  (ND02030R)

Reference (14)：

• [1] E. Betti and M. Sala, “A theory for distance bounding cyclic codes,” BCRI-CGC-Preprint 2007, the file of BCRI-63.pdf on http://www.bcri.ucc.ie/nonPeerReviewed.html
• [2] M. van Eupen and J.H. van Lint, “On the minimum distance of ternary cyclic codes,” IEEE Trans. Inform. Theory, vol.39, no.2, pp.409-422, 1993.
• [3] T. Kaida and J. Zheng, “On improved algorithms of the proposed lower bound including well-known bounds for cyclic codes,” Proc. 2012 International Symposium on Information Theory and its Applications, pp.446-449, 2012.
• [4] T. Kaida and J. Zheng, “On some algorithms on the proposed lower bound of the designed minimum distance for cyclic codes,” Proc. 2013 19th Asia-Pacific Conference on Communications (APCC), pp.520-524, 2013.
• [5] T. Kaida and J. Zheng, “A note on the rank bounded distance and its algorithms for cyclic codes,” Pure and Applied Mathematics Journal, vol.4, no.2-1, pp.36-41, 2015.

Terms in the title (6)： 巡回符号 ,  共役 ,  要素 ,  階層 ,  有界 ,  RANK