| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| RCS, SIP, IT | 2019-02-01 11:40 |
Osaka | Osaka University | Linear Permutation Polynomial Codes Ryoichiro Yoshida, Kenta Kasai (Tokyo Tech)  IT2018-63 SIP2018-93 RCS2018-270 |
Quasi-cyclic low-density parity-check (QC-LDPC) codes are one of the most important code classes of LDPC codes. They hav... [more] | IT2018-63 SIP2018-93 RCS2018-270 pp.161-166 |
| IT | 2018-09-05 09:45 |
Iwate | Seionsou | An Upper Bound on the Generalized Cayley Distance Akira Yamawaki, Hiroshi Kamabe, Shan Lu (Gifu Univ.) IT2018-28 |
Generalized Cayley distance is one of distances which are considered in permutation codes. The generalized Cayley distan... [more] | IT2018-28 pp.7-12 |
| WBS, IT, ISEC | 2018-03-08 09:00 |
Tokyo | Katsusika Campas, Tokyo University of Science | Effect on randomizing components to the security of Minalpher Yuki Kishi, Keita Osafune, Yuta Kuwano, Taroh Sasaki, Atsushi Fujioka (Kanagawa Univ) IT2017-117 ISEC2017-105 WBS2017-98 |
This paper examines randomizing components in Minalpher, where the randomizing components are Shift Rows (SR) and Mix C... [more] | IT2017-117 ISEC2017-105 WBS2017-98 pp.73-79 |
| SR | 2018-01-25 16:20 |
Fukuoka | Fukuoka univ. | [Invited Talk]
An Epidemic of Spatial Modulation and Its Historical Background over the Past 50 Years Naoki Ishikawa (Hiroshima City Univ.) SR2017-99 |
In this paper, a spatial modulation principle is introduced along with its historical background over the past five deca... [more] | SR2017-99 pp.29-34 |
| ISEC, COMP | 2017-12-21 10:20 |
Kochi | Eikokuji Campus, Kochi University of Technology | Effect on Mix Columns to the Security of Minalpher
-- Experimental Results for 6 Rounds -- Yuki Kishi, Taroh Sasaki, Athushi Fujioka (Kanagawa Univ) ISEC2017-73 COMP2017-27 |
This paper examines Mix Columns in Minalpher. The SPN strcture have Mix Columns, and Mix Columns influence for security... [more] | ISEC2017-73 COMP2017-27 pp.7-10 |
| SIS | 2017-12-14 11:10 |
Tottori | Tottori Prefectural Center for Lifelong Learning | A Study on Adaptive Algorithm for Blind MIMO Equalization Kizuku Morita, Hiroki Inada, Naoto Sasaoka (Tottori Univ.), James Okello (UKZN), Yoshio Itoh (Tottori Univ.) SIS2017-35 |
In this paper, we propose a blind equalization system in a Multiple-Input Multiple-Output (MIMO) -OFDM (Orthogonal Frequ... [more] | SIS2017-35 pp.11-14 |
| COMP, ISEC | 2016-12-22 09:30 |
Hiroshima | Hiroshima University | Effect on Mix Columns to the Security of Minalpher Yuki Kishi, Taroh Sasaki, Atsushi Fujioka (Kanagawa Univ) ISEC2016-80 COMP2016-41 |
This article is about Mix Columns in Minalpher. SPN strcture have Mix Columns. Mix Columns have an influence on sa... [more] | ISEC2016-80 COMP2016-41 pp.59-62 |
| MSS, CAS, IPSJ-AL [detail] | 2016-11-25 10:15 |
Hyogo | Kobe Institute of Computing | A 3/2-Approximation Algorithm for the Bipartite Dense Subgraph Problem on Bipartite Permutation Graphs Yuta Inaba, Satoshi Tayu, Shuichi Ueno (Tokyo Tech) CAS2016-71 MSS2016-51 |
(To be available after the conference date) [more] | CAS2016-71 MSS2016-51 pp.93-96 |
| PRMU, IPSJ-CVIM, IBISML [detail] | 2016-09-05 10:00 |
Toyama | Document image retrieval using P2-invariant Tomotaka Ohnishi, Yuji Oyamada, Kazu Mishiba, Katuya Kondo (Tottori Univ.) PRMU2016-56 IBISML2016-11 |
Given an image capturing a document, document image retrieval finds the closest image from a document image database. ... [more] |
PRMU2016-56 IBISML2016-11 pp.13-18 |
|
| IT | 2016-07-29 11:05 |
Fukuoka | Seminar House, Fukuoka Univ. | Construction of LP Decodable Multipermutation Codes Daisuke Ito, Tadashi Wadayama (NIT) IT2016-31 |
In this paper, we propose a construction of linear programming (LP) decodable multipermutation codes. The proposed code... [more] |
IT2016-31 pp.57-62 |
| EMM, ISEC, SITE, ICSS, IPSJ-CSEC, IPSJ-SPT [detail] | 2016-07-15 09:55 |
Yamaguchi | Further improving security of Vector Stream Cipher Atsushi Iwasaki, Ken Umeno (Kyoto Univ.) ISEC2016-28 SITE2016-22 ICSS2016-28 EMM2016-36 |
Vector Stream Cipher (VSC) is a stream cipher which is very fast and is implemented lightly. Some attacks for VSC have ... [more] |
ISEC2016-28 SITE2016-22 ICSS2016-28 EMM2016-36 pp.115-120 |
|
| ISEC, LOIS, SITE | 2014-11-21 14:15 |
Hyogo | Card-based Generation of Random Permutations without Fixed Points Rie Ishikawa, Eikoh Chida (NIT, Ichinoseki Colleage), Takaaki Mizuki (Tohoku Univ.) ISEC2014-58 SITE2014-49 LOIS2014-28 |
Consider a scenario where there are $n$ players who want to exchange gifts. That is, we want to generate a random permu... [more] |
ISEC2014-58 SITE2014-49 LOIS2014-28 pp.13-18 |
|
| NLP, CAS | 2014-10-16 16:45 |
Ehime | Ehime University | Periodical property of Chebyshev polynomials on the residue class rings modulo 2^w Atsushi Iwasaki, Ken Umeno (Kyoto Univ.) CAS2014-67 NLP2014-61 |
The odd degree Chebyshev polynomials are known to be permutation polynomials on the residue class rings modulo $2^w$, ... [more] |
CAS2014-67 NLP2014-61 pp.81-86 |
| COMP | 2014-10-08 15:15 |
Tokyo | Chuo University | Fast Indexing All Eulerian Trails Using Permutation Decision Diagrams Yuma Inoue, Shin-ichi Minato (Hokkaido Univ.) COMP2014-30 |
An Eulerian trail is a trail containing all edges of a given graph exactly once. Although counting problem of Eulerian ... [more] |
COMP2014-30 pp.25-29 |
| IT | 2014-07-18 13:35 |
Hyogo | Kobe University | Improving Performance of Spatially Coupled Code for Burst Erasure by Column Permutation of Parity Check Matrix Hiroki Mori, Tadashi Wadayama (Nagoya Inst. of Tech.) IT2014-32 |
It is well known that spatially-coupled (SC) codes with BP decoding have powerful error correction capability.However, t... [more] | IT2014-32 pp.117-122 |
| NC, MBE (Joint) |
2013-12-21 09:25 |
Gifu | Gifu University | Method to Solve Permutation Problem on Frequency Domain Blind Source Separation using Phase Linearity Takahiro Ishizu, Hidekazu Fukai (Gifu Univ.) NC2013-54 |
In several types of Blind Source Separation (BSS), the convolutive Blind Source Separation remains a difficult problem. ... [more] | NC2013-54 pp.7-10 |
| QIT (2nd) |
2013-11-18 - 2013-11-19 |
Tokyo | Waseda Univ. | [Poster Presentation]
Determining all the eigenvalues of a density operator via a finite-dimensional auxiliary system Toru Tanaka, Mitsunori Kanazawa, Hiromichi Nakazato (Waseda Univ.), Gen Kimura (Shibaura Inst.) |
The eigenvalues of a density operator characterize well quantum-state’s properties such as coherence and entanglement. I... [more] | |
| IBISML | 2013-11-12 15:45 |
Tokyo | Tokyo Institute of Technology, Kuramae-Kaikan | [Poster Presentation]
Optimization-based Multivariate Two-sample Test and Its Efficient Computation Yuki Shinmura, Yusuke Saida, Ichiro Takeuchi (Nagoya Inst. of Tech.) IBISML2013-42 |
Multivariate two-sample test has recently attracted a great deal of interest and its importance has been increasing in m... [more] | IBISML2013-42 pp.45-52 |
| COMP | 2013-09-03 10:45 |
Tottori | A New UCB-based Algorithm for the Matching-Selection Multi-armed Bandit Problem Ryo Watanabe, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) COMP2013-26 |
Permutation bandit problem is a kind of combinatorial multi-armed bandit problem in which an $M$-permutation of $N$ elem... [more] | COMP2013-26 pp.9-16 |
|
| SP, EA, SIP | 2013-05-16 10:55 |
Okayama | Permutation-free clustering-based source separation based on time-varying mixture weights Nobutaka Ito, Shoko Araki, Tomohiro Nakatani (NTT) EA2013-2 SIP2013-2 SP2013-2 |
To avoid the permutation problem in clustering-based source separation, we introduce a mixture model with time-varying, ... [more] | EA2013-2 SIP2013-2 SP2013-2 pp.7-12 |
|
[Return to Top Page]