Ryuhei Mori

According to our database1, Ryuhei Mori authored at least 40 papers between 2008 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Lower bounds on the error probability of multiple quantum channel discrimination by the Bures angle and the trace distance.
CoRR, 2021

Quantum speedups for dynamic programming on n-dimensional lattice graphs.
CoRR, 2021

A Simple and Fast Algorithm for Computing the <i>N</i>-th Term of a Linearly Recurrent Sequence.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Quantum supremacy and hardness of estimating output probabilities of quantum circuits.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence.
CoRR, 2020

Exponential-Time Quantum Algorithms for Graph Coloring Problems.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
Periodic Fourier representation of Boolean functions.
Quantum Inf. Comput., 2019

2017
Better protocol for XOR game using communication protocol and nonlocal boxes.
Quantum Inf. Comput., 2017

Better Protocol for XOR Game using Communication Protocol.
CoRR, 2017

Sum of squares lower bounds for refuting any CSP.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

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

Average shortest path length of graphs of diameter 3.
Proceedings of the Tenth IEEE/ACM International Symposium on Networks-on-Chip, 2016

Lower Bounds for CSP Refutation by SDP Hierarchies.
Proceedings of the Approximation, 2016

2015
Loop Calculus For Nonbinary Alphabets Using Concepts From Information Geometry.
IEEE Trans. Inf. Theory, 2015

Holographic Transformation, Belief Propagation and Loop Calculus for Quantum Information Science.
CoRR, 2015

Peeling Algorithm on Random Hypergraphs with Superlinear Number of Hyperedges.
CoRR, 2015

Holographic transformation, belief propagation and loop calculus for generalized probabilistic theories.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Source and Channel Polarization Over Finite Fields and Reed-Solomon Matrices.
IEEE Trans. Inf. Theory, 2014

Linear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets.
CoRR, 2014

Holographic Transformation for Quantum Factor Graphs.
CoRR, 2014

2013
Effects of Single-Cycle Structure on Iterative Decoding of Low-Density Parity-Check Codes.
IEEE Trans. Inf. Theory, 2013

Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization.
IEEE Trans. Inf. Theory, 2013

New Understanding of the Bethe Approximation and the Replica Method
CoRR, 2013

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

2012
Source and Channel Polarization over Finite Fields and Reed-Solomon Matrix
CoRR, 2012

New Generalizations of the Bethe Approximation via Asymptotic Expansion
CoRR, 2012

Central approximation in statistical physics and information theory.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Statistical Mechanical Analysis of Low-Density Parity-Check Codes on General Markov Channel
CoRR, 2011

Connection between annealed free energy and belief propagation on random factor graph ensembles.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Near concavity of the growth rate for coupled LDPC chains.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Properties and Construction of Polar Codes
CoRR, 2010

Non-binary polar codes using Reed-Solomon codes and algebraic geometry codes.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Refined rate of channel polarization.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Channel polarization on q-ary discrete memoryless channels by arbitrary kernels.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Performance of polar codes with the construction using density evolution.
IEEE Commun. Lett., 2009

Performance and construction of polar codes on symmetric binary-input memoryless channels.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Finite-length analysis of irregular expurgated LDPC codes under finite number of iterations.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number
CoRR, 2008

Asymptotic bit error probability of LDPC codes for the binary erasure channel with finite number of iterations.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008


  Loading...