A typical reconstruction limit for compressed sensing based on lp-norm minimization Y Kabashima, T Wadayama, T Tanaka Journal of Statistical Mechanics: Theory and Experiment 2009 (09), L09003, 2009 | 142 | 2009 |

Gradient descent bit flipping algorithms for decoding LDPC codes T Wadayama, K Nakamura, M Yagita, Y Funahashi, S Usami, I Takumi 2008 International Symposium on Information Theory and Its Applications, 1-6, 2008 | 125 | 2008 |

Low-density parity-check matrices for coding of correlated sources J Muramatsu, T Uyematsu, T Wadayama IEEE Transactions on Information Theory 51 (10), 3645-3654, 2005 | 88 | 2005 |

A coded modulation scheme based on low density parity check codes T Wadayama IEICE transactions on fundamentals of electronics, communications and …, 2001 | 59 | 2001 |

Introduction to Low Density Parity Check Codes and Sum-Product Algorithm T Wadayama w/English translation of abstract thereof, Technical Report of IEICE, 1-8, 2001 | 51 | 2001 |

Coded M-FSK for power line communications AJH Vinck, J Haering, T Wadayama 2000 IEEE International Symposium on Information Theory (Cat. No. 00CH37060 …, 2000 | 41 | 2000 |

Low density parity check matrices for coding of multiple access networks J Muramatsu, T Uyematsu, T Wadayama Proceedings 2003 IEEE Information Theory Workshop (Cat. No. 03EX674), 304-307, 2003 | 40 | 2003 |

An iterative decoding algorithm of low density parity check codes for hidden Markov noise channels T Wadayama Proceedings of International Symposium on Information Theory and Its …, 2000 | 37 | 2000 |

LP-decodable permutation codes based on linearly constrained permutation matrices T Wadayama, M Hagiwara IEEE Transactions on Information Theory 58 (8), 5454-5470, 2012 | 28 | 2012 |

Interior point decoding for linear vector channels based on convex optimization T Wadayama IEEE Transactions on Information Theory 56 (10), 4905-4921, 2010 | 26* | 2010 |

A multilevel construction of permutation codes T Wadayama, H AJ IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and …, 2001 | 25 | 2001 |

An analysis on non-adaptive group testing based on sparse pooling graphs T Wadayama 2013 IEEE International Symposium on Information Theory, 2681-2685, 2013 | 23* | 2013 |

A cutting-plane method based on redundant rows for improving fractional distance M Miwa, T Wadayama, I Takumi IEEE Journal on Selected Areas in Communications 27 (6), 1005-1012, 2009 | 21 | 2009 |

Upper and Lower Bounds on Maximum Nonlinearity of *n*-input *m*-output Boolean FunctionT Wadayama, T Hada, K Wakasugi, M Kasahara Designs, Codes and Cryptography 23 (1), 23-34, 2001 | 19 | 2001 |

On the undetected error probability of binary matrix ensembles T Wadayama IEEE Transactions on Information Theory 56 (5), 2168-2176, 2010 | 14 | 2010 |

An LP decoding algorithm based on primal path-following interior point method T Wadayama 2009 IEEE International Symposium on Information Theory, 389-393, 2009 | 14 | 2009 |

Trainable ISTA for sparse signal recovery D Ito, S Takabe, T Wadayama IEEE Transactions on Signal Processing 67 (12), 3113-3125, 2019 | 13 | 2019 |

A new direction for counting perfect matchings T Izumi, T Wadayama 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 591-598, 2012 | 13 | 2012 |

Statistical mechanical analysis of a typical reconstruction limit of compressed sensing Y Kabashima, T Wadayama, T Tanaka 2010 IEEE International Symposium on Information Theory, 1533-1537, 2010 | 13 | 2010 |

Layered index-less indexed flash codes for improving average performance R Suzuki, T Wadayama 2011 IEEE International Symposium on Information Theory Proceedings, 2138-2142, 2011 | 12 | 2011 |