3 papers
math.CO2026
An algebraic-combinatorial framework for finding the average hitting times in graphs with high regularity
Aida Abiad, Yusaku Nishimura
For any given vertices and in a graph, the hitting time of a random walk on a finite graph is the number of steps it takes for a random walk to reach vertex starting at…
cs.IT2026
A New Approach to Code Smoothing Bounds
Tsuyoshi Miezaki, Yusaku Nishimura, Katsuyuki Takashima
Code smoothing is a phenomenon in which an error distribution makes a code statistically close to the uniform distribution over the ambient space. This closeness is measured by the…
cs.IT2025
On Lattice Isomorphism Problems for Lattices from LCD Codes over Finite Rings
Yusaku Nishimura, Katsuyuki Takashima, Tsuyoshi Miezaki
These days, post-quantum cryptography based on the lattice isomorphism problem has been proposed. Ducas-Gibbons introduced the hull attack, which solves the lattice isomorphism pro…