Faculty of Science and Technology, Department of Information and Communication Sciences
Job title
Professor
Degree
博士（工学）(東京工業大学)
Research funding number
20262280
J-Global ID
200901097688266540
Profile
1991- Applications and fundamental aspects on the error correcting codes, especially on the parameters of algebraic codes 2001- On the performance of LDPC codes and their decoding algorithm 2008- On the convergence behavior of the iterative decoding 2010- Efficient encoding algorithm for linear codes and related topics Coding for Non-volatile memory 2011- Construction of quantum error correcting codes On the convergence bihavior of the iterative decoding(Subject of research) Error Correcting Codes with Iterative Decoding Researches in the Parameters of Algebraic Codes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E100A(12) 2558-2571 Dec 2017 [Refereed]
In this paper, we propose a group theoretic representation suitable for the rank-modulation (RM) scheme over the multi-cell ranking presented by En Gad et al. By introducing an action of the group of all permutation matrices on the set of all perm...
PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016) 131-135 2016
In this paper, we study rank-modulation (RM) rewriting codes based on dominating sets. By introducing a special class of dominating sets in a construction of RM rewriting codes and employing the notion of a group action in an analysis of those cod...
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES E97A(11) 2247-2253 Nov 2014 [Refereed]
The amplitude damping (AD) quantum channel is one of the models describing evolution of quantum states. The construction of quantum error correcting codes for the AD channel based on classical codes has been presented, and Shor et al. proposed a c...
It is well known that LDPC codes can exhibit excellent performance by iterative decoding with O(n) computational complexity. As for their encoding, however, no algorithm has been developed that can be executed with computation less than O(n^2). Th...
Efficient algorithms to solve a system of linear equations have been extensively and deeply investigated in a large number of researches. Among them, the block-triangularization is one of the well-know approaches effective for linear systems defin...
Recently, Haley and Grant introduced the concept of reversible codes - a class of linear codes encodable by the iterative message-passing algorithm based on the Jacobi method over F_2. They also developed a concrete procedure to construct parity c...
Recently, Haley and Grant introduced the concept of reversible codes - a class of linear codes encodable by the iterative message-passing algorithm based on the Jacobi method over F_2. They also developed a concrete procedure to construct parity c...
Taiyu Kamiyama Yuta Ugaya Keisuke Kodaira Tomoharu Shibuya
2018 The International Symposium on Information Theory and Its Applications 28 Oct 2018 Engineering Sciences Society, IEICE
conventional secret sharing, password protected secret sharing (PPSS) was invented. Recently, Nakahara et al. improved Ogata's multiple-use PPSS (mPPSS), which protects multiple data by one password, by employing secure computation known as CSEC70...
Japan-Singapore Workshop on Coding and Information Theory 4 Mar 2018 School of Physical & Mathematical Sciences, Nanyang Technological University
In this talk, a group theoretic representation suitable for the
rank-modulation (RM) scheme over the multi-cell ranking developed by
En Gad et al. is presented. By introducing an action of the group of
all permutation matrices on the set of all pe...
Sophia University