Shohei Satake

Orcid: 0000-0003-1421-1434

According to our database1, Shohei Satake authored at least 13 papers between 2017 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
2-quasi-perfect Lee codes and abelian Ramanujan graphs: a new construction and relationship.
CoRR, January, 2026

2024
On the Paley RIP and Paley Graph Extractor.
Proceedings of the IEEE Information Theory Workshop, 2024

2023
Private simultaneous messages based on quadratic residues.
Des. Codes Cryptogr., December, 2023

Cayley sum graphs and their applications to codebooks.
Des. Codes Cryptogr., April, 2023

2022
Explicit Non-malleable Codes from Bipartite Graphs.
Proceedings of the Arithmetic of Finite Fields - 9th International Workshop, 2022

2021
Graph-Based Construction for Non-Malleable Codes.
IACR Cryptol. ePrint Arch., 2021

On Explicit Random-Like Tournaments.
Graphs Comb., 2021

2020
On 2-parent-identifying set systems of block size 4.
Des. Codes Cryptogr., 2020

On the restricted isometry property of the Paley matrix.
CoRR, 2020

On Compressed Sensing Matrices Breaking the Square-Root Bottleneck.
Proceedings of the IEEE Information Theory Workshop, 2020

Constructions of Complex Codebooks Asymptotically Meeting the Welch Bound: A Graph Theoretic Approach.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
A constructive solution to a problem of ranking tournaments.
Discret. Math., 2019

2017
The Asymmetry Number of Finite Tournaments, and Some Related Results.
Graphs Comb., 2017


  Loading...