Asymptotic bit error probability of LDPC codes for the binary erasure channel with finite number of iterations. - Ryuhei Mori; Kenta Kasai; Tomoharu Shibuya; Kohichi Sakaniwa (ISIT, 2008)

The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number - Ryuhei Mori; Kenta Kasai; Tomoharu Shibuya; Kohichi Sakaniwa (CoRR, 2008)

Finite-length analysis of irregular expurgated LDPC codes under finite number of iterations. - Kenta Kasai; Ryuhei Mori; Toshiyuki Tanaka; Kohichi Sakaniwa (ISIT, 2009)

Performance and construction of polar codes on symmetric binary-input memoryless channels. - Ryuhei Mori; Toshiyuki Tanaka (ISIT, 2009)

Performance of polar codes with the construction using density evolution. - Ryuhei Mori; Toshiyuki Tanaka (IEEE Commun. Lett., 2009)

Channel polarization on q-ary discrete memoryless channels by arbitrary kernels. - Ryuhei Mori; Toshiyuki Tanaka (ISIT, 2010)

Refined rate of channel polarization. - Toshiyuki Tanaka; Ryuhei Mori (ISIT, 2010)

Non-binary polar codes using Reed-Solomon codes and algebraic geometry codes. - Ryuhei Mori; Toshiyuki Tanaka (ITW, 2010)

Properties and Construction of Polar Codes - Ryuhei Mori (CoRR, 2010)

Near concavity of the growth rate for coupled LDPC chains. - Seyed Hamed Hassani; Nicolas Macris; Ryuhei Mori (ISIT, 2011)

Connection between annealed free energy and belief propagation on random factor graph ensembles. - Ryuhei Mori (ISIT, 2011)

Statistical Mechanical Analysis of Low-Density Parity-Check Codes on General Markov Channel - Ryuhei Mori; Toshiyuki Tanaka (CoRR, 2011)

Central approximation in statistical physics and information theory. - Ryuhei Mori; Toshiyuki Tanaka (ISIT, 2012)

New Generalizations of the Bethe Approximation via Asymptotic Expansion - Ryuhei Mori; Toshiyuki Tanaka (CoRR, 2012)

Source and Channel Polarization over Finite Fields and Reed-Solomon Matrix - Ryuhei Mori; Toshiyuki Tanaka (CoRR, 2012)

Loop Calculus for Non-Binary Alphabets using Concepts of Information Geometry. - Ryuhei Mori (CoRR, 2013)

New Understanding of the Bethe Approximation and the Replica Method - Ryuhei Mori (CoRR, 2013)

Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization. - Seyed Hamed Hassani; Ryuhei Mori; Toshiyuki Tanaka; Rüdiger L. Urbanke (IEEE Trans. Inf. Theory, 2013)

Effects of Single-Cycle Structure on Iterative Decoding of Low-Density Parity-Check Codes. - Ryuhei Mori; Toshiyuki Tanaka; Kenta Kasai; Kohichi Sakaniwa (IEEE Trans. Inf. Theory, 2013)

Holographic Transformation for Quantum Factor Graphs. - Ryuhei Mori (CoRR, 2014)

Linear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets. - Ryuhei Mori; Takeshi Koshiba; Osamu Watanabe 001; Masaki Yamamoto 001 (CoRR, 2014)

Source and Channel Polarization Over Finite Fields and Reed-Solomon Matrices. - Ryuhei Mori; Toshiyuki Tanaka (IEEE Trans. Inf. Theory, 2014)

Holographic transformation, belief propagation and loop calculus for generalized probabilistic theories. - Ryuhei Mori (ISIT, 2015)

Peeling Algorithm on Random Hypergraphs with Superlinear Number of Hyperedges. - Ryuhei Mori; Osamu Watanabe 001 (CoRR, 2015)

Holographic Transformation, Belief Propagation and Loop Calculus for Quantum Information Science. - Ryuhei Mori (CoRR, 2015)

Loop Calculus For Nonbinary Alphabets Using Concepts From Information Geometry. - Ryuhei Mori (IEEE Trans. Inf. Theory, 2015)

Lower Bounds for CSP Refutation by SDP Hierarchies. - Ryuhei Mori; David Witmer (APPROX-RANDOM, 2016)

Average shortest path length of graphs of diameter 3. - Nobutaka Shimizu; Ryuhei Mori (NOCS, 2016)

Three-input Majority Function is the Unique Optimal for the Bias Amplification using Nonlocal Boxes. - Ryuhei Mori (CoRR, 2016)

Sum of squares lower bounds for refuting any CSP. - Pravesh K. Kothari; Ryuhei Mori; Ryan O'Donnell; David Witmer (STOC, 2017)

Better Protocol for XOR Game using Communication Protocol. - Ryuhei Mori (CoRR, 2017)

Better protocol for XOR game using communication protocol and nonlocal boxes. - Ryuhei Mori (Quantum Inf. Comput., 2017)

Periodic Fourier representation of Boolean functions. - Ryuhei Mori (Quantum Inf. Comput., 2019)

A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence. - Alin Bostan; Ryuhei Mori (CoRR, 2020)

Quantum supremacy and hardness of estimating output probabilities of quantum circuits. - Yasuhiro Kondo; Ryuhei Mori; Ramis Movassagh (FOCS, 2021)

Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs. - Adam Glos; Martins Kokainis; Ryuhei Mori; Jevgenijs Vihrovs (MFCS, 2021)

A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence. - Alin Bostan; Ryuhei Mori (SOSA, 2021)

Quantum speedups for dynamic programming on n-dimensional lattice graphs. - Adam Glos; Ryuhei Mori; Jevgenijs Vihrovs (CoRR, 2021)

Lower bounds on the error probability of multiple quantum channel discrimination by the Bures angle and the trace distance. - Ryo Ito; Ryuhei Mori (CoRR, 2021)

Exponential-Time Quantum Algorithms for Graph Coloring Problems. - Kazuya Shimizu; Ryuhei Mori (Algorithmica, 2022)

Quantum Algorithm for Higher-Order Unconstrained Binary Optimization and MIMO Maximum Likelihood Detection. - Masaya Norimoto; Ryuhei Mori; Naoki Ishikawa (IEEE Trans. Commun., 2023)

Parameterized Quantum Query Algorithms for Graph Problems. - Tatsuya Terao; Ryuhei Mori (ESA, 2024)