Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Tsuyoshi Miezaki

Tsuyoshi Miezaki

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Info Theory×1Crypto×1

Frequent co-authors

Yusaku Nishimura1×
Katsuyuki Takashima1×

Research Timeline

2026
A New Approach to Code Smoothing Bounds

The paper proposes a novel method using random walks and equitable partitions to derive an inequality for the total variation distance of codes, generalizing existing bounds for finite abelian groups.

Highlighted terms show continued research focus across papers

Papers

cs.ITcs.CRRecentMar 18, 2026

A New Approach to Code Smoothing Bounds

Tsuyoshi Miezaki, Yusaku Nishimura, Katsuyuki Takashima

The paper proposes a novel method using random walks and equitable partitions to derive an inequality for the total variation distance of codes, generalizing existing bounds for finite abelian groups.

View →