IKEGAMI Daisuke

J-GLOBAL         Last updated: Jan 14, 2018 at 10:32
 
Avatar
Name
IKEGAMI Daisuke
E-mail
ikegami.dagmail.com
Job title
Research staff
Degree
D. Eng.

Profile

Erdös number: (at most) 5. The chain of length 5 that I became aware of (2013) is: Daisuke Ikegami -> Yuichi Kaji -> Tadao Kasami -> Torleiv Kløve -> Colbourn Charles Joseph -> Paul Erdös. The chain maybe shrinked. Maybe I have another short chain.

Research Areas

 
 

Academic & Professional Experience

 
Apr 2010
 - 
Sep 2010
Research scientist, Collaborative Facilities for Verification, National Institute of Advanced Industrial Science and Technology (AIST)
 
Apr 2010
 - 
Sep 2010
Research scientist, Information Technology Research Institute of Advanced Institute of Science and Technology (AIST)
 
Apr 2008
 - 
Mar 2010
Research scientist by second profession, Collaborative Facilities for Verification, National Institute of Advanced Industrial Science and Technology (AIST)
 
Oct 2006
 - 
Mar 2010
Research scientist, Center of Verification and Semantics, National Institute of Advanced Industrial Science and Technology (AIST)
 
Jan 2006
 - 
Mar 2006
[postdoc][Core Research for Evolutional Science and Technology(CREST)], Visiting researcher/developer at Chalmers University of Goteborg
 
Apr 2003
 - 
Sep 2006
AIST Research Staff [postdoc][Core Research for Evolutional Science and Technology(CREST)], Laboratoly of Verification System, National Institute of Advanced Industrial Science and Technology (AIST)
 

Published Papers

 
Sennosuke Watanabe, Yoshihide Watanabe and Daisuke Ikegami
Japan Journal of Industrial and Applied Mathematics      Feb 2013   [Refereed]
We give a formulation of the maximum flow problem as an integer programming problem in the standard form. We characterize elementary vectors of the kernel lattice of the matrix coefficient in our formulation in terms of the combinatorial property ...
Hidefumi OHSUGI, Daisuke IKEGAMI, Tomonori KITAMURA, Takayuki HIBI
Advances in Applied Mathematics   31 420-432   Aug 2003   [Refereed]
The combinatorics of reduced Gröbner bases of certain zero-dimensional ideals, which arise when Gröbner basis technique is applied to the soft-decision maximum likelihood decoding of binary linear block codes, will be studied.
Daisuke IKEGAMI, Yuichi Kaji
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E86-A(3) 643-651   Mar 2003   [Refereed]
New algorithms for the soft-derision and the hard-derision maximum likelihood decoding (MLD) for binary linear block codes are proposed. It has been widely known that both MLD can be regarded as an integer programming with binary arithmetic condit...
Daisuke IKEGAMI
Doctoral Thesis      Mar 2003
In the first half of this thesis, a new sub-optimum decoding algorithm is discussed; by combining techniques of maximum likelihood decoding (MLD) and Fossorier's algorithm. In the last half of this thesis, a novel MLD algorithm is proposed: extend...
Daisuke IKEGAMI, Yuichi KAJI
Proceedings of the 2002 IEEE International Symposium on Information Theory (IEEE ISIT2002)   316   Feb 2002   [Refereed]
The soft-decision maximum likelihood decoding belongs to integer programming with constraint linear equations to modular arithmetic. In this paper an algorithm to solve integer programming to modulus an arbitrary positive integer using Gröbner bas...
Yuichi KAJI, Daisuke IKEGAMI
Proceedings of the 2002 IEEE International Symposium on Information Theory (IEEE ISIT2002)   144   Feb 2002   [Refereed]
A new algorithm for the soft-decision decoding of linear block codes is proposed. The algorithm uses the technique of the ordered-statistics decoding proposed by Fossorier and Lin (1995) to estimate a certain part of the transmitted code vector, w...

Conference Activities & Talks

 
A proof of Pythagoras theorem in Agda2
IKEGAMI Daisuke
7th Theorem Proving and Provers meeting   Nov 2011   
Sennosuke Watanabe, Yoshihide Watanabe and Daisuke Ikegami
International Council for Industrial and Applied Mathematics (ICIAM 2011)   Jul 2011   http://www.iciam2011.com/
IKEGAMI DAISUKE
IEICE Technical Report (Institute of Electronics, Information and Communication Engineers)   Jul 2003   
In this paper, we have studied a maximum likelihood decoding for binary linear block codes based on Groebner bases which is proposed by the author. The decoding algorithm can be applied both the soft-decision and the hard-decision, however, the co...